Perturbing the dual feasible region for solving convex quadratic programs

DOI10.1023/A:1022655502360zbMath0886.90112OpenAlexW1562353842MaRDI QIDQ1367785

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

Publication date: 19 April 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022655502360

zbMATH Keywords

convex quadratic programmingduality theory perturbation methods

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (2)

Parametric linear semi-infinite programming ⋮ An exterior point polynomial-time algorithm for convex quadratic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• A sufficient condition for continuity of optimal sets in mathematical programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Smooth Optimization Methods for Minimax Problems
• An unconstrained convex programming approach to solving convex quadratic programming problems
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• An unconstrained convex programming view of linear programming
• Nonlinear leastpth optimization and nonlinear programming
• On the stability of general convex programs under slater’s condition and primal solution boundedness
• Inverse barrier methods for linear programming
• Point-to-Set Maps in Mathematical Programming

This page was built for publication: Perturbing the dual feasible region for solving convex quadratic programs