A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
DOI10.1134/S0965542518030132zbMATH Open1397.65091OpenAlexW2797610513WikidataQ129982736 ScholiaQ129982736MaRDI QIDQ722399FDOQ722399
Authors: Vladimir V. Voloshinov 
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
Recommendations
- The optimality conditions for approximate solutions of quasiconvex programming problems
- On simultaneous approximation in quadratic integer programming
- On the complexity of approximating a KKT point of quadratic programming
- scientific article; zbMATH DE number 3882219
- Approximation algorithms for quadratic programming
- Approximating quadratic programming with bound and quadratic constraints
- scientific article; zbMATH DE number 4112388
- scientific article; zbMATH DE number 4102819
- An approximation approach to non-strictly convex quadratic semi-infinite programming
- scientific article; zbMATH DE number 4204120
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Applications of mathematical programming (90C90)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encyclopedia of Optimization
- Title not available (Why is that?)
- Nonconvex minimization problems
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Title not available (Why is that?)
- A New Approach to Lagrange Multipliers
- On approximate KKT condition and its extension to continuous variational inequalities
- Traces and Emergence of Nonlinear Programming
- Linearization method for inverse convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On regularity conditions in mathematical programming problems
- Approximate KKT points and a proximity measure for termination
- Title not available (Why is that?)
- Title not available (Why is that?)
- On estimates for solutions of systems of convex inequalities
This page was built for publication: A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722399)
