Pages that link to "Item:Q2393085"
From MaRDI portal
The following pages link to Approximate KKT points and a proximity measure for termination (Q2393085):
Displayed 28 items.
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation (Q722399) (← links)
- Approximate Karush-Kuhn-Tucker condition in multiobjective optimization (Q727219) (← links)
- An approximate strong KKT condition for multiobjective optimization (Q1617113) (← links)
- Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search (Q1652178) (← links)
- On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization (Q1733333) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
- Proximity measures based on KKT points for constrained multi-objective optimization (Q2038917) (← links)
- Approximations for Pareto and proper Pareto solutions and their KKT conditions (Q2168054) (← links)
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278) (← links)
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints (Q2178885) (← links)
- Error estimation in nonlinear optimization (Q2250085) (← links)
- A stopping criterion for multi-objective optimization evolutionary algorithms (Q2282042) (← links)
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method (Q2297582) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems (Q2674587) (← links)
- (Q3384701) (← links)
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization (Q5116546) (← links)
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited (Q5252220) (← links)
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming (Q5879577) (← links)
- Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems (Q6086968) (← links)
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming (Q6182322) (← links)