The developments of proximal point algorithms
From MaRDI portal
Publication:2158107
DOI10.1007/S40305-021-00352-XzbMath1502.47081OpenAlexW4220684005MaRDI QIDQ2158107
Fan Jiang, Kai Wang, Deren Han, Zhongming Wu, Ke Guo, Xing-Ju Cai
Publication date: 22 July 2022
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00352-x
optimizationproximal point algorithmsBregman distancevariational inequality problemsapproximate criteriazero-finding problems
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Research exposition (monographs, survey articles) pertaining to operator theory (47-02) Decomposition methods (49M27) Numerical methods for variational inequalities and related problems (65K15)
Related Items (10)
On the linear convergence of a Bregman proximal point algorithm ⋮ A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity ⋮ Sparse broadband beamformer design via proximal optimization Techniques ⋮ Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM ⋮ A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems ⋮ Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks ⋮ Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems ⋮ A customized inertial proximal alternating minimization for SVD-free robust principal component analysis ⋮ Several kinds of acceleration techniques for unconstrained optimization first-order algorithms ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Comments on ``The proximal point algorithm revisited
- A new approximate proximal point algorithm for maximal monotone operator
- An approximate proximal-extragradient type method for monotone variational inequalities
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Inexact proximal point methods in metric spaces
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- Inexact proximal point method for general variational inequalities
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal-point algorithm using a linear proximal term
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- Metric subregularity and the proximal point method
- Monotone (nonlinear) operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A variable-penalty alternating directions method for convex optimization
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximal minimization algorithm with \(D\)-functions
- Variable metric bundle methods: From conceptual to implementable forms
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Enlargement of monotone operators with applications to variational inequalities
- A new hybrid generalized proximal point algorithm for variational inequality problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- A new inexact alternating directions method for monotone variational inequalities
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- An LQP-based two-step method for structured variational inequalities
- A relaxed approximate proximal point algorithm
- A family of variable metric proximal methods
- A quasi-second-order proximal bundle algorithm
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- An accelerated inexact proximal point algorithm for convex minimization
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- A proximal point algorithm with asymmetric linear term
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- A proximal point algorithm revisit on the alternating direction method of multipliers
- Multiplier and gradient methods
- Inexact proximal point algorithms and descent methods in optimization
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- Inexact Proximal Point Methods for Variational Inequality Problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Implicit Functions and Solution Mappings
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A generalized proximal point algorithm for certain non-convex minimization problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Bregman Monotone Optimization Algorithms
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- The indefinite proximal point algorithms for maximal monotone operators
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- A class of nonlinear proximal point algorithms for variational inequality problems
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
- A new accuracy criterion for approximate proximal point algorithms
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The developments of proximal point algorithms
