全文获取类型
收费全文 | 284篇 |
免费 | 5篇 |
国内免费 | 8篇 |
专业分类
力学 | 11篇 |
数学 | 284篇 |
物理学 | 2篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 6篇 |
2013年 | 17篇 |
2012年 | 29篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 23篇 |
2008年 | 28篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 6篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 11篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 1篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有297条查询结果,搜索用时 15 毫秒
1.
非光滑非凸多目标规划解的充分条件 总被引:4,自引:0,他引:4
Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件. 相似文献
2.
本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆,我们提出了牛顿法和不精确牛顿法,它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。 相似文献
3.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
4.
Regina S. Burachik Rafail N. Gasimov Nergiz A. Ismayilova C. Yalçin. Kaya 《Journal of Global Optimization》2006,34(1):55-78
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented
Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal
and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the
step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and
an optimal control problem.
*Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2.
Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA. 相似文献
5.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
6.
The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053. 相似文献
7.
Liqun Qi 《Operations Research Letters》1997,20(5):223-228
We show that strong differentiability at solutions is not necessary for superlinear convergence of quasi-Newton methods for solving nonsmooth equations. We improve the superlinear convergence result of Ip and Kyparisis for general quasi-Newton methods as well as the Broyden method. For a special example, the Newton method is divergent but the Broyden method is superlinearly convergent. 相似文献
8.
Erica L. Plambeck Bor-Ruey Fu Stephen M. Robinson Rajan Suri 《Mathematical Programming》1996,75(2):137-176
In this paper we propose a method for optimizing convex performance functions in stochastic systems. These functions can include
expected performance in static systems and steady-state performance in discrete-event dynamic systems; they may be nonsmooth.
The method is closely related to retrospective simulation optimization; it appears to overcome some limitations of stochastic
approximation, which is often applied to such problems. We explain the method and give computational results for two classes
of problems: tandem production lines with up to 50 machines, and stochastic PERT (Program Evaluation and Review Technique)
problems with up to 70 nodes and 110 arcs.
Sponsored by the National Science Foundation under grant number CCR-9109345, by the Air Force Systems Command, USAF, under
grant numbers F49620-93-1-0068 and F49620-95-1-0222, by the U.S. Army Research Office under grant number DAAL03-92-G-0408,
and by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144. The U.S. Government has certain
rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding
any copyright notation thereon.
Sponsored by a Wisconsin/Hilldale Research Award, by the U.S. Army Space and Strategic Defense Command under contract number
DASG60-91-C-0144, and the Air Force Systems Command, USAF, under grant number F49620-93-1-0068.
Sponsored by the National Science Foundation under grant number DDM-9201813. 相似文献
9.
A. Bihain 《Journal of Optimization Theory and Applications》1984,44(4):545-568
In this paper, we present an implementable algorithm to minimize a nonconvex, nondifferentiable function in
m
. The method generalizes Wolfe's algorithm for convex functions and Mifflin's algorithm for semismooth functions to a broader class of functions, so-called upper semidifferentiable. With this objective, we define a new enlargement of Clarke's generalized gradient that recovers, in special cases, the enlargement proposed by Goldstein. We analyze the convergence of the method and discuss some numerical experiments.The author would like to thank J. B. Hiriart-Urruty (Toulouse) for having provided him with Definition 2.1 and the referees for their constructive remarks about a first version of the paper. 相似文献
10.
This paper is concerned with optimal control problems of Mayer and Bolza type for systems governed by a semilinear state equationx(t)=Ax(t) + f(t, x(t), u(t)), u(t) U, whereA is the infinitesimal generator of a strongly continuous semigroup in a Banach spaceX. We prove necessary and sufficient conditions for optimality and then use these conditions to investigate properties of the value function related to superdifferentials. Conversely, we use the value function to obtain criteria for optimality and feedback systems.Work (partially) supported by the Research Project Equazioni di evoluzione e applicazioni fisicomatematiche (M.U.R.S.T.-Italy). 相似文献