Proximal methods in view of interior-point strategies

DOI10.1023/A:1022693618829zbMath0908.90210OpenAlexW1491634526MaRDI QIDQ1265063

Alexander Kaplan, Rainer Tichatschke

Publication date: 28 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022693618829

zbMATH Keywords

convex optimizationinterior-point methodsill-posed problemsproximal point algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS ⋮ Dual convergence for penalty algorithms in convex programming ⋮ A proximal interior point algorithm with applications to image processing ⋮ Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder). ⋮ Proximal interior point method for convex semi-infinite programming ⋮ Deep unfolding of a proximal interior point method for image restoration

Cites Work

• Penalty-proximal methods in convex programming
• Penalization in non-classical convex programming via variational convergence
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex Analysis
• Combining The Proximal Algorithm And Tikhonov Regularization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item