A dual-active-set algorithm for positive semi-definite quadratic programming

DOI10.1016/S0025-5610(96)00069-XMaRDI QIDQ1373722zbMATHOpenAlexFDO

Authors Natashia Boland

Publication date 25 November 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0025-5610(96)00069-x

zbMATH Keywords

positive semi-definitefinite terminationactive-set methodgeneralized algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
• Primal and dual active-set methods for convex quadratic programming
• On active-set methods for the quadratic programming problem
• A dual method for solving positive definite quadratic programming
• An active-set algorithm for norm constrained quadratic problems
• Positive semidefinite penalty method for quadratically constrained quadratic programming
• scientific article; zbMATH DE number 1131695
• The dual active set algorithm and its application to linear programming
• An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program

Cited in

(20)

• scientific article; zbMATH DE number 2143977 (Why is no real title available?)
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• A dual method for solving positive definite quadratic programming
• A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
• scientific article; zbMATH DE number 4154218 (Why is no real title available?)
• On the quadratic programming algorithm of Goldfarb and Idnani
• A decomposition algorithm for solving large-scale quadratic programming problems
• scientific article; zbMATH DE number 3950212 (Why is no real title available?)
• A dual gradient-projection method for large-scale strictly convex quadratic problems
• An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
• A globally convergent filter interior-point method for positive definite quadratic programming
• scientific article; zbMATH DE number 4003917 (Why is no real title available?)
• Primal and dual active-set methods for convex quadratic programming
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
• Computing upper and lower bounds in interval decision trees
• Convex optimization techniques in compliant assembly simulation
• Redundancies in positive-semidefinite quadratic programming
• Dual support method for solving convex quadratic programs

This page was built for publication: A dual-active-set algorithm for positive semi-definite quadratic programming

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