An exterior point polynomial-time algorithm for convex quadratic programming

DOI10.1007/S10589-014-9710-8MaRDI QIDQ2340489zbMATH OpenOpenAlexFDO

Authors Da-Gang Tian

Publication date 20 April 2015

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-014-9710-8

zbMATH Keywords

regularizationpolynomial-time algorithmpath-followingconvex quadratic programmingexterior pointself-concordant function

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A new penalty function algorithm for convex quadratic programming
• An interior-exterior approach for convex quadratic programming
• A new primal-dual polynomial algorithm for convex quadratic programming
• An exterior Newton method for strictly convex quadratic programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations

Cites work

• scientific article; zbMATH DE number 4131946 (Why is no real title available?)
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 1306986 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 4197288 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
• A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
• A Primal-Dual Exterior Point Method for Nonlinear Optimization
• A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
• A mathematical view of interior-point methods in convex optimization
• A new bound for the quadratic assignment problem based on convex quadratic programming
• A new penalty function algorithm for convex quadratic programming
• A new polynomial-time algorithm for linear programming
• A new primal-dual path-following method for convex quadratic programming
• A non-interior path following method for convex quadratic programming problems with bound constraints
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A numerically stable dual method for solving strictly convex quadratic programs
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming
• A primal-dual regularized interior-point method for convex quadratic programs
• A repository of convex quadratic programming problems
• A special newton-type optimization method
• Adaptive constraint reduction for convex quadratic programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An entire space polynomial-time algorithm for linear programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• An exterior Newton method for strictly convex quadratic programming
• An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
• An interior-exterior approach for convex quadratic programming
• An unconstrained convex programming approach to solving convex quadratic programming problems
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• Complexity of a noninterior path-following method for the linear complementarity problem
• Convergence analysis of an inexact potential reduction method for convex quadratic programming
• Erratum to: ``Nonlinear programming without a penalty function or a filter
• Exterior point algorithms for nearest points and convex quadratic programs
• Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior-point Lagrangian decomposition method for separable convex optimization
• Khachiyan’s algorithm for linear programming
• Modified barrier functions (theory and methods)
• Nonlinear programming without a penalty function or a filter
• Nonlinear rescaling and proximal-like methods in convex optimization
• Nonlinear rescaling vs. smoothing technique in convex optimization
• On the convergence of the exponential multiplier method for convex programming
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• On the entropic perturbation and exponential penalty methods for linear programming
• Path-following gradient-based decomposition algorithms for separable convex optimization
• Perturbing the dual feasible region for solving convex quadratic programs
• Primal and dual convergence of a proximal point exponential penalty method for linear programming
• Primal-dual nonlinear rescaling method for convex optimization
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update
• Primal–dual exterior point method for convex optimization
• QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
• Remark on the Constraint Sets in Linear Programming
• Robust Statistics
• Stabilizing control of robustness for systems with maximum uncertain parameters
• Symmetric Quasidefinite Matrices
• The Newton modified barrier method for QP problems
• The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions

Cited in

(8)

• An interior-exterior approach for convex quadratic programming
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix
• An exterior Newton method for strictly convex quadratic programming
• An exterior point method for the convex programming problem
• On second-order conic programming duals for robust convex quadratic optimization problems
• scientific article; zbMATH DE number 710572 (Why is no real title available?)
• Exterior point algorithms for nearest points and convex quadratic programs
• An exterior point simplex algorithm for (general) linear programming problems

Describes a project that uses

Uses Software

• NETLIB LP Test Set
• QPSchur

This page was built for publication: An exterior point polynomial-time algorithm for convex quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340489)