Approximate KKT points and a proximity measure for termination
From MaRDI portal
Publication:2393085
DOI10.1007/s10898-012-9920-5zbMath1297.90150MaRDI QIDQ2393085
Rupesh Tulshyan, Joydeep Dutta, Kalyanmoy Deb, 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
proximity measure; evolutionary optimization; KKT optimality conditions; termination condition; approximate KKT point; Knitro
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, An Approximation Scheme for Distributionally Robust Nonlinear Optimization, The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited, Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, 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 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, An approximate strong KKT condition for multiobjective optimization, Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search, On quasi \(\epsilon\)-solution for robust convex optimization problems, Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs, A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data, Proximity measures based on KKT points for constrained multi-objective optimization, Approximations for Pareto and proper Pareto solutions and their KKT conditions, Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps, Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints, Error estimation in nonlinear optimization, A stopping criterion for multi-objective optimization evolutionary algorithms, 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, On \(\epsilon\)-solutions for robust semi-infinite optimization problems, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- Nonlinear multiobjective optimization
- An efficient constraint handling method for genetic algorithms
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Function minimization by conjugate gradients
- On sequential optimality conditions for smooth constrained optimization
