Coupling the proximal point algorithm with approximation methods

DOI10.1023/A:1022621905645zbMath0902.90129OpenAlexW202170286MaRDI QIDQ1379933

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

zbMATH Keywords

steepest descentTikhonov regularizationpenalty methodsproximal point iterationviscosity methods

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

A new inertial-type hybrid projection-proximal algorithm for monotone inclusions ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ Iterative Method for Non-Stationary Mixed Variational Inequalities ⋮ Combining fast inertial dynamics for convex optimization with Tikhonov regularization ⋮ Inexact first-order primal-dual algorithms ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ Convergence rates of accelerated proximal gradient algorithms under independent noise ⋮ Two-level iterative method for non-stationary mixed variational inequalities ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Dual convergence for penalty algorithms in convex programming ⋮ Iterative regularization via dual diagonal descent ⋮ A projection-proximal point algorithm for solving generalized variational inequalities ⋮ Application of the penalty method to nonstationary approximation of an optimization problem ⋮ Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization ⋮ An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces ⋮ VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm ⋮ A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^* ⋮ 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

Cites Work

• Asymptotic behavior of solutions to a class of nonlinear evolution equations
• Penalty-proximal methods in convex programming
• Penalization in non-classical convex programming via variational convergence
• Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
• Produits infinis de resolvantes
• Convergence of some algorithms for convex minimization
• Limiting behavior of weighted central paths in linear programming
• Asymptotic analysis of the exponential penalty trajectory in linear programming
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Path-Following Methods for Linear Programming
• Monotone Operators and the Proximal Point Algorithm
• Numerical methods for nondifferentiable convex optimization
• Viscosity Solutions of Minimization Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item