Primal and dual convergence of a proximal point exponential penalty method for linear programming

DOI10.1007/S10107-002-0295-0zbMath1007.90048OpenAlexW1964996729MaRDI QIDQ1849261

Yanyan Li

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/173111

zbMATH Keywords

diagonal inexact proximal point iteration

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (10)

Subdivision scheme tuning around extraordinary vertices ⋮ Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's ⋮ Coupling the gradient method with a general exterior penalization scheme for convex minimization ⋮ Dual convergence for penalty algorithms in convex programming ⋮ Iterative regularization via dual diagonal descent ⋮ Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ An exterior point polynomial-time algorithm for convex quadratic programming

This page was built for publication: Primal and dual convergence of a proximal point exponential penalty method for linear programming