Adaptive constraint reduction for convex quadratic programming
From MaRDI portal
Publication:434155
DOI10.1007/S10589-010-9324-8zbMATH Open1245.90082OpenAlexW2040675561MaRDI QIDQ434155FDOQ434155
Authors: Jin Hyuk Jung, André L. Tits, Dianne P. O'Leary 
Publication date: 10 July 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9324-8
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
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Title not available (Why is that?)
- Numerical Optimization
- Support-vector networks
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Interior-Point Methods for Massive Support Vector Machines
- Adaptive constraint reduction for training support vector machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- An active-set strategy in an interior point method for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Potential Reduction Algorithm Allowing Column Generation
- Title not available (Why is that?)
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- Newton-KKT interior-point methods for indefinite quadratic programming
- A ``build-down scheme for linear programming
Cited In (12)
- On the augmented subproblems within sequential methods for nonlinear programming
- Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
- An exterior point polynomial-time algorithm for convex quadratic 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
Uses Software
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)
