Optimality Conditions for Degenerate Extremum Problems with Equality Constraints

DOI10.1137/S0363012901388488zbMath1037.49025MaRDI QIDQ4443003

Olga A. Brezhneva, Alexey A. Tret'yakov

Publication date: 8 January 2004

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0363012901388488

zbMATH Keywords

constrained optimization; optimality conditions; Lyusternik theorem; nonregular problems

Mathematics Subject Classification ID

90C30: Nonlinear programming

49N60: Regularity of solutions in optimal control

46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics

49K27: Optimality conditions for problems in abstract spaces

Related Items

Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming, Nonregular mixed-constrained optimization problems, Necessary and Sufficient Optimality Conditions for Non-regular Problems, Degenerate equality constrained optimization problems and P-regularity theory, \(p\)th-order optimality conditions in singular calculus of variations: elements of \(p\)-regularity theory, On reductibility of degenerate optimization problems to regular operator equations, On solution existence for the perturbed degenerate optimization problem with equality constraints: \(p\)-order stability condition, High order stability conditions for degenerate optimization problems; elements of \(p\)-regularity theory, \(p\)th order Kuhn-Tucker-type optimality conditions for a singular inequality constrained optimization problem, On the existence of solutions to nonlinear equations involving singular mappings with non-zero \(p\)-kernel, \(p\)-regular nonlinearity: tangency at singularity in degenerate optimization problems, The \(p\)th order optimality conditions for nonregular optimization problems, Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices, Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints, The \(p\)th-order optimality conditions for inequality constrained optimization problems, Generalized convexity in non-regular programming problems with inequality-type constraints, When the Karush-Kuhn-Tucker theorem fails: constraint qualifications and higher-order optimality conditions for degenerate optimization problems, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, Implicit function and tangent cone theorems for singular inclusions and applications to nonlinear programming, Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization, Irregular optimization models and \(p\)-order Kuhn-Tucker optimality conditions, Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems, Come Back to Lagrange. Thep-Factor Analysis of Optimality Conditions