Coupling the proximal point algorithm with approximation methods
From MaRDI portal
Publication:1379933
DOI10.1023/A:1022621905645zbMATH Open0902.90129OpenAlexW202170286MaRDI QIDQ1379933FDOQ1379933
Authors: Roberto Cominetti 
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022621905645
Recommendations
- scientific article; zbMATH DE number 5586189
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- scientific article; zbMATH DE number 854129
- New Proximal Point Algorithms for Convex Minimization
- A new method for nonsmooth convex optimization
Cites Work
- Convergence of some algorithms for convex minimization
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Title not available (Why is that?)
- Produits infinis de resolvantes
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Viscosity Solutions of Minimization Problems
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Path-Following Methods for Linear Programming
- Numerical methods for nondifferentiable convex optimization
- Title not available (Why is that?)
- Penalty-proximal methods in convex programming
- Title not available (Why is that?)
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Penalization in non-classical convex programming via variational convergence
- Title not available (Why is that?)
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic behavior of solutions to a class of nonlinear evolution equations
- Limiting behavior of weighted central paths in linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (30)
- Damped inertial dynamics with vanishing Tikhonov regularization: strong asymptotic convergence towards the minimum norm solution
- Dual convergence for penalty algorithms in convex programming
- Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution
- Title not available (Why is that?)
- Title not available (Why is that?)
- A projection-proximal point algorithm for solving generalized variational inequalities
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- A new inertial-type hybrid projection-proximal algorithm for monotone inclusions
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- Application of the penalty method to limit quasi-equilibrium problems
- Inexact first-order primal-dual algorithms
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- Iterative Method for Non-Stationary Mixed Variational Inequalities
- Application of the penalty method to nonstationary approximation of an optimization problem
- An abstract proximal point algorithm
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
- Fast Moreau envelope computation I: Numerical algorithms
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- Two-level iterative method for non-stationary mixed variational inequalities
- Selective bi-coordinate method for limit non-smooth resource allocation type problems
- Iterative regularization via dual diagonal descent
- An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
- How good are the proximal point algorithms?
- Principled analyses and design of first-order methods with inexact proximal operators
This page was built for publication: Coupling the proximal point algorithm with approximation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379933)
