A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
From MaRDI portal
(Redirected from Publication:722399)
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
Cites work
- scientific article; zbMATH DE number 3828663 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 3662899 (Why is no real title available?)
- scientific article; zbMATH DE number 3727076 (Why is no real title available?)
- scientific article; zbMATH DE number 3365059 (Why is no real title available?)
- scientific article; zbMATH DE number 3400017 (Why is no real title available?)
- A New Approach to Lagrange Multipliers
- Approximate KKT points and a proximity measure for termination
- Encyclopedia of Optimization
- Linearization method for inverse convex programming
- Nonconvex minimization problems
- On approximate KKT condition and its extension to continuous variational inequalities
- On estimates for solutions of systems of convex inequalities
- On regularity conditions in mathematical programming problems
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Traces and Emergence of Nonlinear Programming
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)