Dual support method for solving convex quadratic programs

DOI10.1080/02331930902878341MaRDI QIDQ2786329zbMATH OpenOpenAlexFDO

Authors B. Brahmi, Mohand Ouamer Bibi

Publication date 21 September 2010

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convex quadratic programmingdual support methodcoordinator support

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical methods involving duality (49M29) Linear-quadratic optimal control problems (49N10)

Recommendations

• A numerically stable dual method for solving strictly convex quadratic programs
• A dual method for solving positive definite quadratic programming
• scientific article; zbMATH DE number 3894842
• Primal-dual method of solving convex quadratic programming problems
• An effective generalization of the direct support method in quadratic convex programming
• Duality bound method for the general quadratic programming problem with quadratic constraints
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• scientific article; zbMATH DE number 3856834
• A canonical dual approach for solving linearly constrained quadratic programs
• scientific article; zbMATH DE number 3902406

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• A dual-active-set algorithm for positive semi-definite quadratic programming
• A numerically stable dual method for solving strictly convex quadratic programs
• Numerical Optimization
• QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
• Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control
• The Simplex Method for Quadratic Programming

Cited in

(8)

• An effective generalization of the direct support method in quadratic convex programming
• A dual method for solving positive definite quadratic programming
• A hybrid direction algorithm for solving optimal control problems
• A two-phase support method for solving linear programs: numerical experiments
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• An effective generalization of the direct support method
• Primal-dual method for solving a linear-quadratic multi-input optimal control problem
• A hybrid direction algorithm for solving linear programs

Describes a project that uses

Uses Software

• QPSchur

This page was built for publication: Dual support method for solving convex quadratic programs

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