Results 211 to 220 of about 17,832 (262)

Global Optimality Conditions in Nonconvex Optimization

Journal of Optimization Theory and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Global Optimality Conditions for Nonconvex Optimization

Journal of Global Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonseparation of Sets and Optimality Conditions

SIAM Journal on Control and Optimization, 2017
Summary: Two new concepts of uniform approximating cones are introduced and discussed. The main result is a theorem for nonseparability of two closed sets. As an application of this result, an abstract Lagrange multiplier rule and a necessary optimality condition of Pontryagin maximum principle type for an optimal control problem in infinite ...
Mikhail Ivanov Krastanov, N. K. Ribarska
openaire   +2 more sources

Regularity Conditions in Vector Optimization

Journal of Optimization Theory and Applications, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BIGI, GIANCARLO, PAPPALARDO, MASSIMO
openaire   +3 more sources

Optimality conditions for global optimization (I)

Acta Mathematicae Applicatae Sinica, 1985
With the help of the theory of measure and integration several global optimality conditions, which are sufficient and necessary, are given for minimizing a continuous function over a topological space.
openaire   +1 more source

OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION

Optimization, 2002
Abstract In this paper, we study constrained locally Lipschitz vector optimization problems in which the objective and constraint spaces are Hilbert spaces, the decision space is a Banach space, the dominating cone and the constraint cone may be with empty interior. Necessary optimality conditions for this type of optimization problems are derived.
openaire   +1 more source

On Sufficient Conditions in Nonsmooth Optimization

Mathematics of Operations Research, 1982
Second-order conditions are given which are sufficient for a point to be a local minimizer for certain nonlinear programming problems defined on Banach spaces. The functions involved in the problems are not required to be smooth or convex; indeed, they are required only to satisfy certain conditions which are weak enough to be satisfied by all locally
openaire   +2 more sources

Condition Number Theorems in Optimization

SIAM Journal on Optimization, 2003
Summary: Condition numbers for optimization problems in Banach spaces are considered. Lower and upper estimates of the (suitably defined) distance from ill-conditioning are obtained in terms of the reciprocal of condition numbers. An approach is presented based on the metric regularity of the inverse to the arg min map.
openaire   +2 more sources

Necessary Conditions in Nonsmooth Optimization

Mathematics of Operations Research, 1984
The paper contains four theorems concerning first order necessary conditions for a minimum in nonsmooth optimization problems in Banach spaces: a Lagrange multiplier rule for a mathematical programming problem in which an infinite dimensional equality constraint is included in the constraints, a general maximum principle for nonsmooth optimal control ...
openaire   +2 more sources

Necessary Optimality Conditions in Multiobjective Dynamic Optimization

SIAM Journal on Control and Optimization, 2004
Let \(F: [a,b] \times \mathbb{R}^n \multimap \mathbb{R}^n\) be a closed-valued multimap, measurable in the first argument and sub-Lipschitzean in the second one; \(S \subset \mathbb{R}^n \times \mathbb{R}^n\) a nonempty closed set and \(f: \mathbb{R}^n \times \mathbb{R}^n \rightarrow \mathbb{R}^m\) a map. Extending the result of \textit{A.
Saïd Bellaassali, Abderrahim Jourani
openaire   +2 more sources