Perturbing the dual feasible region for solving convex quadratic programs
type: Item
instance of: scholarly article
title: Perturbing the dual feasible region for solving convex quadratic programs
zbMATH Open document ID: 0886.90112
DOI: 10.1023/A:1022655502360
author: Shu-Cherng Fang
author: H.-S. Jacob Tsao
published in: Journal of Optimization Theory and Applications
publication date: 1998-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1069771
zbMATH Keywords: convex quadratic programming
zbMATH Keywords: duality theory perturbation methods
MaRDI profile type: Publication
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Q4692623
cites work: Inverse barrier methods for linear programming
cites work: An unconstrained convex programming view of linear programming
cites work: An unconstrained convex programming approach to solving convex quadratic programming problems
cites work: Q3141920
cites work: Q4118986
cites work: Q4114551
cites work: Q5649356
cites work: Nonlinear leastpth optimization and nonlinear programming
cites work: Q3690580
cites work: Acceleration of the leastpth algorithm for minimax optimization with engineering applications
cites work: Smooth Optimization Methods for Minimax Problems
cites work: Q4895330
cites work: Q4739659
cites work: Q5591247
cites work: Point-to-Set Maps in Mathematical Programming
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: On the stability of general convex programs under slater’s condition and primal solution boundedness
cites work: A sufficient condition for continuity of optimal sets in mathematical programming
full work available at URL: a:1022655502360
OpenAlex ID: W1562353842
description: scientific article; zbMATH DE number 1069771