Adaptive constraint reduction for convex quadratic programming
From MaRDI portal
Recommendations
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- A primal-dual interior-point algorithm for quadratic programming
- scientific article; zbMATH DE number 3982419
Cites work
- scientific article; zbMATH DE number 5359577 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3787949 (Why is no real title available?)
- scientific article; zbMATH DE number 1215249 (Why is no real title available?)
- scientific article; zbMATH DE number 679874 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Potential Reduction Algorithm Allowing Column Generation
- A ``build-down scheme for linear programming
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- A new polynomial-time algorithm for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- Adaptive constraint reduction for training support vector machines
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An active-set strategy in an interior point method for linear programming
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Interior-Point Methods for Massive Support Vector Machines
- Newton-KKT interior-point methods for indefinite quadratic programming
- Numerical Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Support-vector networks
Cited in
(12)- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- On the augmented subproblems within sequential methods for nonlinear programming
- Adaptive algorithm for constrained least-squares problems
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming
- An exterior point polynomial-time algorithm for convex quadratic programming
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
This page was built for publication: Adaptive constraint reduction for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434155)
