Coupling the proximal point algorithm with approximation methods
From MaRDI portal
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
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Asymptotic behavior of solutions to a class of nonlinear evolution equations
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Convergence of some algorithms for convex minimization
- scientific article; zbMATH DE number 4012323 (Why is no real title available?)
- scientific article; zbMATH DE number 4045488 (Why is no real title available?)
- scientific article; zbMATH DE number 3659298 (Why is no real title available?)
- scientific article; zbMATH DE number 3734412 (Why is no real title available?)
- scientific article; zbMATH DE number 125245 (Why is no real title available?)
- scientific article; zbMATH DE number 687723 (Why is no real title available?)
- scientific article; zbMATH DE number 823376 (Why is no real title available?)
- scientific article; zbMATH DE number 854129 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- Limiting behavior of weighted central paths in linear programming
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Path-Following Methods for Linear Programming
- Penalization in non-classical convex programming via variational convergence
- Penalty-proximal methods in convex programming
- Produits infinis de resolvantes
- Viscosity Solutions of Minimization Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(33)- An abstract proximal point algorithm
- Two-level iterative method for non-stationary mixed variational inequalities
- Iterative regularization via dual diagonal descent
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
- Application of the penalty method to limit quasi-equilibrium problems
- Damped inertial dynamics with vanishing Tikhonov regularization: strong asymptotic convergence towards the minimum norm solution
- Inexact first-order primal-dual algorithms
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization
- Selective bi-coordinate method for limit non-smooth resource allocation type problems
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
- scientific article; zbMATH DE number 4030337 (Why is no real title available?)
- How good are the proximal point algorithms?
- Dual convergence for penalty algorithms in convex programming
- Application of the penalty method to nonstationary approximation of an optimization problem
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- scientific article; zbMATH DE number 854129 (Why is no real title available?)
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- scientific article; zbMATH DE number 7390803 (Why is no real title available?)
- Iterative Method for Non-Stationary Mixed Variational Inequalities
- A note for the convergence of approximate proximal point algorithm
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
- Principled analyses and design of first-order methods with inexact proximal operators
- A projection-proximal point algorithm for solving generalized variational inequalities
- Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution
- Scaled alternating multiplier method for solving the matrix equation AXB + CXD = E
- A new inertial-type hybrid projection-proximal algorithm for monotone inclusions
- Fast Moreau envelope computation I: Numerical algorithms
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)
