The developments of proximal point algorithms
From MaRDI portal
Publication:2158107
approximate criteriaBregman distanceoptimizationproximal point algorithmsvariational inequality problemszero-finding problems
Research exposition (monographs, survey articles) pertaining to operator theory (47-02) Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Nonsmooth analysis (49J52) Decomposition methods (49M27) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Recommendations
- The proximal point algorithm revisited
- Proximal-point algorithm using a linear proximal term
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- The indefinite proximal point algorithms for maximal monotone operators
- An approximate proximal point algorithm for maximal monotone inclusion problems
Cites work
- A Class of Inexact Variable Metric Proximal Point Algorithms
- A class of nonlinear proximal point algorithms for variational inequality problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A family of variable metric proximal methods
- A generalized proximal point algorithm for certain non-convex minimization problems
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- A logarithmic-quadratic proximal method for variational inequalities
- A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
- A new accuracy criterion for approximate proximal point algorithms
- A new approximate proximal point algorithm for maximal monotone operator
- A new hybrid generalized proximal point algorithm for variational inequality problems
- A new inexact alternating directions method for monotone variational inequalities
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A proximal point algorithm with asymmetric linear term
- A proximal point method for the variational inequality problem in Banach spaces
- A quasi-second-order proximal bundle algorithm
- A relaxed approximate proximal point algorithm
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- A variable-penalty alternating directions method for convex optimization
- An accelerated inexact proximal point algorithm for convex minimization
- An approximate proximal-extragradient type method for monotone variational inequalities
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- An LQP-based two-step method for structured variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Approximate iterations in Bregman-function-based proximal algorithms
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bregman Monotone Optimization Algorithms
- Characterization of metric regularity of subdifferentials
- Comments on ``The proximal point algorithm revisited
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of Proximal-Like Algorithms
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization algorithms
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enlargement of monotone operators with applications to variational inequalities
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Entropy-Like Proximal Methods in Convex Programming
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 1306982 (Why is no real title available?)
- scientific article; zbMATH DE number 686906 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3252891 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Inexact and accelerated proximal point algorithms
- Inexact proximal point algorithms and descent methods in optimization
- Inexact proximal point method for general variational inequalities
- Inexact proximal point methods for variational inequality problems
- Inexact proximal point methods in metric spaces
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Metric subregularity and the proximal point method
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- On alternating direction methods of multipliers: a historical perspective
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- On the O(1/t) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- On the convergence of primal-dual hybrid gradient algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Proximal minimization algorithm with \(D\)-functions
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximal-point algorithm using a linear proximal term
- Proximité et dualité dans un espace hilbertien
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The indefinite proximal point algorithms for maximal monotone operators
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- Variable metric bundle methods: From conceptual to implementable forms
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- Variational Analysis
Cited in
(21)- An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
- How good are the proximal point algorithms?
- On the linear convergence of a Bregman proximal point algorithm
- A generalized proximal point algorithm and its convergence rate
- scientific article; zbMATH DE number 7483223 (Why is no real title available?)
- 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
- Symplectic discretization approach for developing new proximal point algorithm
- Behavioral portfolio optimization via cumulative prospect theory with a symmetric alternating direction method of multipliers
- A balanced augmented Lagrangian method with correction for linearly constrained optimization
- Improved accelerated gradient algorithms with line search for smooth convex optimization problems
- Golden ratio type Douglas-Rachford splitting method for solving structured inverse variational inequality problems
- Forward-reflected-backward method with extrapolation and linesearch for monotone inclusion problems
- Inertial alternating direction method of multipliers with logarithmic-quadratic proximal regularization
- An inertial block proximal alternating linearized minimization method for cardinality-constrained index tracking problems
This page was built for publication: The developments of proximal point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158107)
