Proximal methods in view of interior-point strategies

DOI10.1023/A:1022693618829MaRDI QIDQ1265063zbMATH OpenOpenAlexFDO

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

Recommendations

• Proximal interior point approach in convex programming (ill-posed problems)^*†
• Modified procedures of iterative prox-regularization
• Interior proximal methods and central paths for convex second-order cone programming
• Proximal interior point method for convex semi-infinite programming
• A generalized interior-point barrier function approach for smooth convex programming with linear constraints

Cites work

• scientific article; zbMATH DE number 4012323 (Why is no real title available?)
• scientific article; zbMATH DE number 3641200 (Why is no real title available?)
• scientific article; zbMATH DE number 587626 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 687723 (Why is no real title available?)
• scientific article; zbMATH DE number 766273 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Combining The Proximal Algorithm And Tikhonov Regularization
• Convex Analysis
• Monotone Operators and the Proximal Point Algorithm
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Penalization in non-classical convex programming via variational convergence
• Penalty-proximal methods in convex programming

Cited in

(9)

• Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
• Proximal interior point method for convex semi-infinite programming
• Deep unfolding of a proximal interior point method for image restoration
• Dual convergence for penalty algorithms in convex programming
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
• Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder).
• Interior proximal methods and central paths for convex second-order cone programming
• A note on error estimates for some interior penalty methods
• A proximal interior point algorithm with applications to image processing

This page was built for publication: Proximal methods in view of interior-point strategies

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