Proximal methods in view of interior-point strategies
From MaRDI portal
Publication:1265063
DOI10.1023/A:1022693618829zbMATH Open0908.90210OpenAlexW1491634526MaRDI QIDQ1265063FDOQ1265063
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
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
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Title not available (Why is that?)
- Convex Analysis
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combining The Proximal Algorithm And Tikhonov Regularization
- Title not available (Why is that?)
- Penalty-proximal methods in convex programming
- Penalization in non-classical convex programming via variational convergence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Dual convergence for penalty algorithms in convex programming
- 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
- Proximal interior point method for convex semi-infinite programming
- A proximal interior point algorithm with applications to image processing
- A note on error estimates for some interior penalty methods
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- Deep unfolding of a proximal interior point method for image restoration
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)
