The indefinite proximal point algorithms for maximal monotone operators

DOI10.1080/02331934.2020.1751158zbMATH Open1476.90310OpenAlexW3016892956MaRDI QIDQ5009166FDOQ5009166

Authors: 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

Recommendations

• Inexact inertial proximal algorithm for maximal monotone operators
• A proximal point algorithm of maximal monotone operator in Banach spaces
• scientific article; zbMATH DE number 2190327
• A proximal point method for the sum of maximal monotone operators
• On the proximal point algorithm for strongly monotone operators
• A proximal point algorithm of maximal monotone operator in reflexive Banach spaces
• A new approximate proximal point algorithm for maximal monotone operator
• scientific article; zbMATH DE number 2113076
• Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
• Inertial proximal algorithm for difference of two maximal monotone operators

zbMATH Keywords

convex optimizationglobal convergenceproximal point algorithmindefinite proximal terminexact criteria

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Title not available (Why is that?)
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Title not available (Why is that?)
• Convex analysis and monotone operator theory in Hilbert spaces
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Multiplier and gradient methods
• Enlargement of monotone operators with applications to variational inequalities
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• 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
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate iterations in Bregman-function-based proximal algorithms
• A relaxed approximate proximal point algorithm
• Title not available (Why is that?)
• Convergence of Proximal-Like Algorithms
• A new approximate proximal point algorithm for maximal monotone operator
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Title not available (Why is that?)
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• Proximal minimization algorithm with \(D\)-functions
• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• A new accuracy criterion for approximate proximal point algorithms
• An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
• An approximate proximal-extragradient type method for monotone variational inequalities
• A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
• Inexact and accelerated proximal point algorithms
• Inexact proximal point algorithms and descent methods in optimization
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• A preconditioning proximal Newton method for nondifferentiable convex optimization
• An improved first-order primal-dual algorithm with a new correction step
• A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
• Definiteness and semidefiniteness of quadratic forms revisited
• Self-adaptive inexact proximal point methods
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• A Class of Inexact Variable Metric Proximal Point Algorithms
• A new hybrid generalized proximal point algorithm for variational inequality problems
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
• A class of nonlinear proximal point algorithms for variational inequality problems
• A proximal point algorithm with asymmetric linear term

Cited In (7)

• Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM
• A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
• Proximal point algorithm for infinite pseudo-monotone bifunctions
• An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
• An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
• The developments of proximal point algorithms
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

This page was built for publication: The indefinite proximal point algorithms for maximal monotone operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009166)