On approximate KKT condition and its extension to continuous variational inequalities
From MaRDI portal
Publication:637544
DOI10.1007/s10957-011-9802-xzbMath1220.90130OpenAlexW2121953083MaRDI QIDQ637544
María Laura Schuverdt, Gabriel Haeser
Publication date: 6 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9802-x
Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ An approximate strong KKT condition for multiobjective optimization ⋮ An adaptive approach to adjust constraint bounds and its application in structural topology optimization ⋮ Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems ⋮ Optimality conditions for nonlinear second-order cone programming and symmetric cone programming ⋮ A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences ⋮ On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods ⋮ A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization ⋮ A relaxed constant positive linear dependence constraint qualification and applications ⋮ A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation ⋮ Approximate Karush-Kuhn-Tucker condition in multiobjective optimization ⋮ On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming ⋮ A smooth proximity measure for optimality in multi-objective optimization using Benson's method ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization ⋮ A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New condition characterizing the solutions of variational inequality problems
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- A practical optimality condition without constraint qualifications for nonlinear programming
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Inexact-restoration algorithm for constrained optimization
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Solution point differentiability without strict complementarity in nonlinear programming
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Augmented Lagrangian methods for variational inequality problems
- On second-order optimality conditions for nonlinear programming
- On sequential optimality conditions for smooth constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
This page was built for publication: On approximate KKT condition and its extension to continuous variational inequalities
