The indefinite proximal point algorithms for maximal monotone operators
From MaRDI portal
Publication:5009166
DOI10.1080/02331934.2020.1751158zbMath1476.90310OpenAlexW3016892956MaRDI QIDQ5009166
Fan Jiang, Deren Han, Xing-Ju Cai
Publication date: 19 August 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1751158
global convergenceconvex optimizationproximal point algorithmindefinite proximal terminexact criteria
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (4)
The developments of proximal point algorithms ⋮ An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization ⋮ Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- An improved first-order primal-dual algorithm with a new correction step
- A new approximate proximal point algorithm for maximal monotone operator
- An approximate proximal-extragradient type method for monotone variational inequalities
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- Definiteness and semidefiniteness of quadratic forms revisited
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Proximal minimization algorithm with \(D\)-functions
- 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
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- A relaxed approximate proximal point algorithm
- A family of variable metric proximal methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- An accelerated inexact proximal point algorithm for convex minimization
- A proximal point algorithm with asymmetric linear term
- Self-adaptive inexact proximal point methods
- Multiplier and gradient methods
- Inexact proximal point algorithms and descent methods in optimization
- 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
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A Class of Inexact Variable Metric Proximal Point Algorithms
- 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
- Convergence of Proximal-Like Algorithms
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A class of nonlinear proximal point algorithms for variational inequality problems
- Convex analysis and monotone operator theory in Hilbert spaces
- A new accuracy criterion for approximate proximal point algorithms
This page was built for publication: The indefinite proximal point algorithms for maximal monotone operators
