On approximate KKT condition and its extension to continuous variational inequalities
From MaRDI portal
Publication:637544
DOI10.1007/S10957-011-9802-XzbMATH Open1220.90130OpenAlexW2121953083MaRDI QIDQ637544FDOQ637544
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
Recommendations
- New condition characterizing the solutions of variational inequality problems
- On AKKT optimality conditions for cone-constrained vector optimization problems
- A simply constrained optimization reformulation of KKT systems arising from variational inequalities
- An approximate strong KKT condition for multiobjective optimization
- A new sequential optimality condition for constrained optimization and algorithmic consequences
Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Augmented Lagrangian methods for variational inequality problems
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Inexact-restoration algorithm for constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Title not available (Why is that?)
- A practical optimality condition without constraint qualifications for nonlinear programming
- On second-order optimality conditions for nonlinear programming
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Solution point differentiability without strict complementarity in nonlinear programming
- Title not available (Why is that?)
- On sequential optimality conditions for smooth constrained optimization
- New condition characterizing the solutions of variational inequality problems
Cited In (21)
- An approximate strong KKT condition for multiobjective optimization
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- A relaxed constant positive linear dependence constraint qualification and applications
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- An adaptive approach to adjust constraint bounds and its application in structural topology optimization
- Sequential M-stationarity conditions for general optimization problems
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
- A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences
- Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- A novel sequential optimality condition for smooth constrained optimization and algorithmic consequences
- Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method
This page was built for publication: On approximate KKT condition and its extension to continuous variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637544)
