Nonlinear Lagrangian theory for nonconvex optimization.
From MaRDI portal
Publication:5942347
DOI10.1023/A:1017513905271zbMath1049.90119MaRDI QIDQ5942347
Publication date: 28 August 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)
Related Items
SAMBA: safe model-based \& active reinforcement learning ⋮ Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems ⋮ Multipliers and general Lagrangians ⋮ On the gap functions of prevariational inequalities ⋮ On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization ⋮ Duality for multiobjective optimization via nonlinear Lagrangian functions ⋮ Unified nonlinear Lagrangian approach to duality and optimal paths ⋮ Efficiency and approachability of nonconvex bicriteria programs ⋮ Are dualities appropriate for duality theories in optimization? ⋮ Extended Lagrange and penalty functions in optimization ⋮ Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization ⋮ Strong duality in optimization: shifted power reformulation ⋮ Modified Lagrangian and least root approaches for general nonlinear optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general theory of dual optimization problems
- Zero duality gaps in infinite-dimensional programming
- Second-order global optimality conditions for convex composite optimization
- Zero duality gap for a class of nonconvex optimization problems
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
- Second order necessary and sufficient conditions for convex composite NDO
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
- Variational Analysis