A numerically stable dual method for solving strictly convex quadratic programs

Donald Goldfarb, A. Idnani

Type: Article

Publication Date: 1983-09-01

Citations: 1018

DOI: https://doi.org/10.1007/bf02591962

View Publication

Locations

Mathematical Programming - View

Similar Works

Action	Title	Year	Authors
+	A Dual Method for Solving General Convex Quadratic Programs	2009	Belkacem Brahmi Mohand Ouamer Bibi
+	Numerically stable methods for quadratic programming	1978	Philip E. Gill Walter Murray
+	Dual and primal-dual methods for solving strictly convex quadratic programs	1982	Donald Goldfarb A. Idnani
+	A numerical algorithm to solve quadratically constrained quadratic programs	1973	Rayno David Niemi
+	A primal-dual interior-point algorithm for quadratic programming	2006	Juan José Domínguez‐Jiménez María D. González-Lima
+	Primal-Dual Method of Solving Convex Quadratic Programming Problems	2000	Vasile Moraru
+	Dual coordinate ascent methods for non-strictly convex minimization	1993	TsengPaul
+	Dual coordinate ascent methods for non-strictly convex minimization	1993	Paul Tseng
+	A dual gradient-projection method for large-scale strictly convex quadratic problems	2016	Nicholas I. M. Gould Daniel P. Robinson
+	An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization	2024	Billel Zaoui Djamel Benterki Adnan Yassine
+	A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints	1975	H. Mukai E. Polak
+	A DUAL ALGORITHM WITH MULTIPLE CONSTRAINT ADDITIONS FOR STRICTLY CONVEX QUADRATIC PROGRAMMING	1993	Ioannis C. Demetriou
+	A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming	1994	André L. Tits Jian L. Zhou
+	A primal–dual interior point method for nonlinear semidefinite programming	2011	Hiroshi Yamashita Hiroshi Yabe Kouhei Harada
+	Computational aspects of a Dual algorithm for quadratically constrained quadratic programs	1973	Donald W. Hearn William Randolph
+	A New Practically Efficient Interior Point Method for Convex Quadratic Programming	2008	Katta G. Murty
+	A primal-dual trust-region algorithm for non-convex nonlinear programming	2000	Andrew R. Conn Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+	A Primal-Dual Regularized Interior-Point Method for Convex Quadratic Programs	2010	Dominique Orban Michael P. Friedlander
+	A primal–dual regularized interior-point method for convex quadratic programs	2012	Michael P. Friedlander Dominique Orban
+	A new primal-dual interior-point algorithm for convex quadratic optimization	2008	Guoqiang Wang Yanqin Bai Yong Liu Min Zhang

Works That Cite This (392)

Action	Title	Year	Authors
+ PDF Chat	Primal and dual active-set methods for convex quadratic programming	2015	Anders Forsgren Philip E. Gill Elizabeth Wong
+	Modeling the Cholesky factors of covariance matrices of multivariate longitudinal data	2015	Priya Kohli Tanya P. Garcia Mohsen Pourahmadi
+	Piecewise linear approximations in nonconvex nonsmooth optimization	2009	Manlio Gaudioso Enrico Gorgone Maria Flavia Monaco
+ PDF Chat	Nonlinear Programming: Algorithms, Software, and Applications	2005	Klaus Schittkowski Christian Zillober
+ PDF Chat	Minimal subfamilies and the probabilistic interpretation for modulus on graphs	2016	Nathan Albin Pietro Poggi‐Corradini
+	Time-Stepping Methods that Favor Positivity for Atmospheric Chemistry Modeling	2002	Adrian Sandu
+	A dual gradient-projection method for large-scale strictly convex quadratic problems	2016	Nicholas I. M. Gould Daniel P. Robinson
+	Spectral Projected Gradient Methods: Review and Perspectives	2014	E. G. Birgin J. M. Martı́nez Marcos Raydan
+	A Simple New Algorithm for Quadratic Programming with Applications in Statistics	2012	Mary C. Meyer
+ PDF Chat	Low-Rank Modifications of Riccati Factorizations for Model Predictive Control	2017	Isak Nielsen Daniel Axehill

Works Cited by This (33)

Action	Title	Year	Authors
+	SOLVING QUADRATIC PROGRAMS BY AN EXACT PENALTY FUNCTION11This work is supported in part by the National Science Foundation under Grant ENG 79-03881 and also by the United States Army under Contract No. DAAG29-75-C-0024.	1981	Shih-Ping Han
+	Dual and primal-dual methods for solving strictly convex quadratic programs	1982	Donald Goldfarb A. Idnani
+ PDF Chat	Numerical Techniques in Mathematical Programming	1970	Richard H. Bartels Gene H. Golub Michael A. Saunders
+ PDF Chat	A Parametric Method for Semidefinite Quadratic Programs	1969	Michael D. Grigoriadis Klaus Ritter
+	Matrix factorizations in optimization of nonlinear functions subject to linear constraints	1976	Donald Goldfarb
+	Quadratic Programming as an Extension of Classical Quadratic Maximization	1992	Henri Theil C. van de Panne
+	An example of cycling in a feasible point algorithm	1981	M. J. D. Powell
+	Complementary pivot theory of mathematical programming	1968	Richard W. Cottle George B. Dantzig
+	The Simplex and the Dual Method for Quadratic Programming	1964	C. van de Panne Andrew B. Whinston
+ PDF Chat	Methods for modifying matrix factorizations	1974	Philip E. Gill Gene H. Golub Walter Murray Michael A. Saunders