A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
From MaRDI portal
Publication:722399
DOI10.1134/S0965542518030132zbMath1397.65091OpenAlexW2797610513MaRDI QIDQ722399
Publication date: 23 July 2018
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542518030132
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Quadratic programming (90C20)
Cites Work
- On approximate KKT condition and its extension to continuous variational inequalities
- On estimates for solutions of systems of convex inequalities
- Linearization method for inverse convex programming
- Approximate KKT points and a proximity measure for termination
- Encyclopedia of Optimization
- Nonconvex minimization problems
- A New Approach to Lagrange Multipliers
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Traces and Emergence of Nonlinear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item