An unconstrained convex programming approach to solving convex quadratic programming problems

DOI10.1080/02331939308843884MaRDI QIDQ3835665zbMATH OpenOpenAlexFDO

Authors Shu-Cherng Fang, H.-S. Jacob Tsao

Publication date 21 August 1995

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939308843884

zbMATH Keywords

convex analysisconvex quadratic programming\(\varepsilon\)-optimal solutionunconstrained convex programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15)

Recommendations

• Convex quadratic programming approach
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• On convex relaxations for quadratically constrained quadratic programming
• scientific article; zbMATH DE number 7647868
• Unconstrained convex programming approach to linear programming
• An algorithm for indefinite quadratic programming with convex constraints
• A new convex relaxation for quadratically constrained quadratic programming
• An unconstrained convex programming view of linear programming
• Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
• A novel optimization method for nonconvex quadratically constrained quadratic programs

Cites work

• scientific article; zbMATH DE number 3591873 (Why is no real title available?)
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• A new polynomial-time algorithm for linear programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• An O(n^ 3L) primal interior point algorithm for convex quadratic programming
• Convex Analysis
• Curved search methods for unconstrained optimization
• Entropy in linear programs
• Geometric Programming
• On the convex programming approach to linear programming

Cited in

(16)

• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• Convex optimization approach to a single quadratically constrained quadratic minimization problem
• An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions
• Continuous Approaches to the Unconstrained Binary Quadratic Problems
• An approach to the solution of nonlinear unconstrained optimization problems
• On second-order conic programming duals for robust convex quadratic optimization problems
• scientific article; zbMATH DE number 1461863 (Why is no real title available?)
• Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
• An exterior point polynomial-time algorithm for convex quadratic programming
• On the entropic perturbation and exponential penalty methods for linear programming
• Perturbing the dual feasible region for solving convex quadratic programs
• Primal-dual method of solving convex quadratic programming problems
• An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
• UOBYQA: unconstrained optimization by quadratic approximation
• Controlled perturbations for quadratically constrained quadratic programs
• Unconstrained convex programming approach to linear programming

This page was built for publication: An unconstrained convex programming approach to solving convex quadratic programming problems

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