A dual-active-set algorithm for positive semi-definite quadratic programming
From MaRDI portal
Publication:1373722
DOI10.1016/S0025-5610(96)00069-XzbMATH Open0893.90139OpenAlexW4239349808MaRDI QIDQ1373722FDOQ1373722
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
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 (19)
- Title not available (Why is that?)
- On the quadratic programming algorithm of Goldfarb and Idnani
- Title not available (Why is that?)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- A dual method for solving positive definite quadratic programming
- Convex optimization techniques in compliant assembly simulation
- Redundancies in positive-semidefinite quadratic programming
- A decomposition algorithm for solving large-scale quadratic programming problems
- Primal and dual active-set methods for convex quadratic programming
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
- Computing upper and lower bounds in interval decision trees
- Title not available (Why is that?)
- Dual support method for solving convex quadratic programs
- A globally convergent filter interior-point method for positive definite quadratic programming
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- Title not available (Why is that?)
- A dual gradient-projection method for large-scale strictly convex quadratic problems
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)
