Perturbed variations of penalty function methods. Example: Projective SUMT

DOI10.1007/BF02055202MaRDI QIDQ2639773zbMATH OpenOpenAlexFDO

Authors 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)

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
• scientific article; zbMATH DE number 16508

Cites work

• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• 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

Cited in

(6)

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

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)