Perturbed variations of penalty function methods. Example: Projective SUMT

DOI10.1007/BF02055202zbMath0718.90072OpenAlexW2920822263MaRDI QIDQ2639773

Anthony V. Fiacco

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02055202

zbMATH Keywords

penalty functionProjective SUMT

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Inertial Game Dynamics and Applications to Constrained Optimization ⋮ Legendre transform and applications to finite and infinite optimization ⋮ Learning in Games via Reinforcement and Regularization

Cites Work

• A new polynomial-time algorithm for linear programming
• Introduction to sensitivity and stability analysis in nonlinear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Projective SUMT Method for Convex Programming
• Unnamed Item

This page was built for publication: Perturbed variations of penalty function methods. Example: Projective SUMT