Approximate KKT points and a proximity measure for termination
From MaRDI portal
Publication:2393085
DOI10.1007/S10898-012-9920-5zbMATH Open1297.90150OpenAlexW2155858901MaRDI QIDQ2393085FDOQ2393085
Authors: Joydeep Dutta, Kalyanmoy Deb, Rupesh Tulshyan, Ramnik Arora 
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9920-5
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
evolutionary optimizationKKT optimality conditionsproximity measuretermination conditionapproximate KKT pointKnitro
Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient constraint handling method for genetic algorithms
- Function minimization by conjugate gradients
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Nonlinear multiobjective optimization
- Optimization and nonsmooth analysis
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Test examples for nonlinear programming codes
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- On sequential optimality conditions for smooth constrained optimization
- A new sequential optimality condition for constrained optimization and algorithmic consequences
Cited In (32)
- Title not available (Why is that?)
- An approximate strong KKT condition for multiobjective optimization
- Simple termination conditions for k-nearest neighbor method
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- 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
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- 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
- 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
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- Error estimation in nonlinear optimization
- Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
- A smooth proximity measure for optimality in multi-objective optimization using Benson's method
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
Uses Software
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)
