New Proximal Point Algorithms for Convex Minimization

DOI10.1137/0802032zbMath0778.90052OpenAlexW2037679050MaRDI QIDQ4015443

Osman Güler

Publication date: 13 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0802032

zbMATH Keywords

augmented Lagrangianproximal point algorithmproper lower-semicontinuous convex functionglobal convergence rates

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (only showing first 100 items - show all)

Generalized proximal point algorithms with correction terms and extrapolation ⋮ Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities ⋮ High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods ⋮ Accelerated minimax algorithms flock together ⋮ Several kinds of acceleration techniques for unconstrained optimization first-order algorithms ⋮ Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling ⋮ Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization ⋮ Accelerated proximal algorithms with a correction term for monotone inclusions ⋮ Proximal Splitting Methods in Signal Processing ⋮ A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem ⋮ Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization ⋮ Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA ⋮ Comparison of minimization methods for nonsmooth image segmentation ⋮ The developments of proximal point algorithms ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ On finite termination of an inexact proximal point algorithm ⋮ Generalizing the Optimized Gradient Method for Smooth Convex Minimization ⋮ Fast proximal algorithms for nonsmooth convex optimization ⋮ On the linear convergence of a Bregman proximal point algorithm ⋮ Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Inexact first-order primal-dual algorithms ⋮ Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity ⋮ From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Accelerated differential inclusion for convex optimization ⋮ Adaptive \(l_1\)-regularization for short-selling control in portfolio selection ⋮ Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients ⋮ Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming ⋮ An accelerated inexact proximal point algorithm for convex minimization ⋮ Coercivity and generalized proximal algorithms: application -- traveling around the world ⋮ Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3 ⋮ Inertial-relaxed splitting for composite monotone inclusions ⋮ Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping ⋮ Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity ⋮ Stochastic first-order methods for convex and nonconvex functional constrained optimization ⋮ Strongly convergent inertial proximal point algorithm without on-line rule ⋮ An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration ⋮ A unified and tight linear convergence analysis of the relaxed proximal point algorithm ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Dual fast projected gradient method for quadratic programming ⋮ On the weak and strong convergence of modified forward-backward-half-forward splitting methods ⋮ The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$ ⋮ Convergence of a proximal point algorithm for solving minimization problems ⋮ Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems ⋮ Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming ⋮ Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ Contracting Proximal Methods for Smooth Convex Optimization ⋮ Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems ⋮ Convergence of the augmented decomposition algorithm ⋮ Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Accelerated proximal point method for maximally monotone operators ⋮ On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ On the proximal gradient algorithm with alternated inertia ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ Computing proximal points of nonconvex functions ⋮ Fast convergence of generalized forward-backward algorithms for structured monotone inclusions ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ An introduction to continuous optimization for imaging ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions ⋮ Convergence analysis of inexact proximal point algorithms on Hadamard manifolds ⋮ Some new step-size rules for optimization problems ⋮ Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions ⋮ Accelerated forward–backward algorithms for structured monotone inclusions ⋮ An interior point-proximal method of multipliers for convex quadratic programming ⋮ Robustness of the hybrid extragradient proximal-point algorithm. ⋮ Convergence rate estimates for the gradient differential inclusion ⋮ Distributed Learning with Sparse Communications by Identification ⋮ On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces ⋮ A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems ⋮ Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Convergence analysis of some methods for minimizing a nonsmooth convex function ⋮ Convergence analysis of a proximal newton method¹ ⋮ An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration ⋮ Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives ⋮ Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ Stochastic primal dual fixed point method for composite optimization ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces ⋮ Convergence results of two-step inertial proximal point algorithm ⋮ From differential equation solvers to accelerated first-order methods for convex optimization ⋮ A control-theoretic perspective on optimal high-order optimization ⋮ Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination ⋮ Generalized Momentum-Based Methods: A Hamiltonian Perspective ⋮ Unnamed Item ⋮ A Stochastic Variance Reduced Primal Dual Fixed Point Method for Linearly Constrained Separable Optimization ⋮ Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure ⋮ A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes

This page was built for publication: New Proximal Point Algorithms for Convex Minimization