Tubularity and Asymptotic Convergence of Penalty Trajectories in Convex Programming

DOI10.1137/S1052623401384771zbMATH Open1032.90022MaRDI QIDQ4785877FDOQ4785877

Author name not available (Why is that?)

Publication date: 5 January 2003

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

asymptotic analysisconvex programmingpenalty methodstubular functions

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited In (2)

• Dual convergence for penalty algorithms in convex programming
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Functional convergence theorems for the penalty function method 👍 👎
• A dual regularized method for solving a class of convex minimization problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Existence of Approximate Exact Penalty in Constrained Optimization 👍 👎
• Title not available (Why is that?) 👍 👎
• Global convergence and rate of convergence of a method of centers 👍 👎
• Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints 👍 👎
• One modification of the penalty shifting method for problems of nonlinear programming 👍 👎

This page was built for publication: Tubularity and Asymptotic Convergence of Penalty Trajectories in Convex Programming

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