Perturbed variations of penalty function methods. Example: Projective SUMT

DOI10.1007/BF02055202zbMATH Open0718.90072OpenAlexW2920822263MaRDI QIDQ2639773FDOQ2639773

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)

Cites Work

• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• The Projective SUMT Method for Convex Programming
• Introduction to sensitivity and stability analysis in nonlinear programming

Cited In (6)

• Logarithmic SUMT limits in convex programming
• Learning in games via reinforcement and regularization
• K-K-T multiplier estimates and objective function lower bounds from projective SUMT
• Inertial Game Dynamics and Applications to Constrained Optimization
• Legendre transform and applications to finite and infinite optimization
• The Projective SUMT Method for Convex Programming

   Recommendations

• The Projective SUMT Method for Convex Programming 👍 👎
• Logarithmic SUMT limits in convex programming 👍 👎
• Penalization in non-classical convex programming via variational convergence 👍 👎
• On the weak convergence of the method of penalty functions with respect to argument 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639773)