Approximate KKT points and a proximity measure for termination
From MaRDI portal
(Redirected from Publication:2393085)
Recommendations
- Proximity measures based on KKT points for constrained multi-objective optimization
- Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- Stability properties of KKT points in vector optimization
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An efficient constraint handling method for genetic algorithms
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Function minimization by conjugate gradients
- Nonlinear multiobjective optimization
- On sequential optimality conditions for smooth constrained optimization
- Optimization and nonsmooth analysis
- Test examples for nonlinear programming codes
Cited in
(38)- An approximate strong KKT condition for multiobjective optimization
- Simple termination conditions for k-nearest neighbor method
- The complexity of gradient descent: CLS = PPAD pls
- A new sequential optimality condition for constrained nonsmooth optimization
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- KKT and weakly complementary approximate KKT conditions for interval-valued optimization problems
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- A stopping criterion for multi-objective optimization evolutionary algorithms
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Proximity measures based on KKT points for constrained multi-objective optimization
- Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
- Approximate Karush-Kuhn-Tucker conditions for multiobjective fractional programming problems
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Approximate solutions for a class of multiobjective interval-valued optimization problems with applications
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- 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
- Error estimation in nonlinear optimization
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
- The smoothed duality gap as a stopping criterion
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method
- Safe zeroth-order optimization using quadratic local approximations
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
This page was built for publication: Approximate KKT points and a proximity measure for termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393085)
