Extended duality for nonlinear programming
From MaRDI portal
Publication:707770
DOI10.1007/s10589-008-9208-3zbMath1226.90100MaRDI QIDQ707770
Publication date: 8 October 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9208-3
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization of statistical functions with simulated annealing
- A collection of test problems for constrained global optimization algorithms
- Global minimization by reducing the duality gap
- Error bounds in mathematical programming
- Error bounds in mathematical programming. Special issue
- On the absence of duality gap for Lagrange-type functions
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
- On solving nonconvex optimization problems by reducing the duality gap
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- Calmness and Exact Penalization
- An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
- Distributed dynamic programming
- An Exact Penalization Viewpoint of Constrained Optimization
- Estimates of the Duality Gap in Nonconvex Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Decreasing Functions with Applications to Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
