Approximate iterations in Bregman-function-based proximal algorithms
From MaRDI portal
Publication:1290655
DOI10.1007/BF02680553zbMath0920.90117MaRDI QIDQ1290655
Publication date: 15 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
convergencegeneral maximal monotone operatorgeneralized Bregman-function-based proximal point algorithms
Related Items
LQP method with a new optimal step size rule for nonlinear complementarity problems, Error sensitivity for strongly convergent modifications of the proximal point algorithm, Approximate proximal methods in vector optimization, An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems, Steered sequential projections for the inconsistent convex feasibility problem, An inexact proximal method for quasiconvex minimization, An self-adaptive LQP method for constrained variational inequalities, Inexact proximal point method for general variational inequalities, The prediction-correction approach to nonlinear complementarity problems, A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities, Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework, The developments of proximal point algorithms, Extended auxiliary problem principle to variational inequalities involving multi-valued operators, Strong convergence theorems for approximating common fixed points of families of nonexpansive mappings and applications, Approximating zeros of monotone operators by proximal point algorithms, A framework for analyzing local convergence properties with applications to proximal-point algorithms, Hybrid approximate proximal method with auxiliary variational inequality for vector optimization, An inexact algorithm with proximal distances for variational inequalities, Generalized Bregman projections in convex feasibility problems, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces, An interior proximal method for a class of quasimonotone variational inequalities, An inexact proximal method with proximal distances for quasimonotone equilibrium problems, An accelerated inexact proximal point algorithm for convex minimization, An approximate proximal point algorithm for maximal monotone inclusion problems, Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods, A modified proximal point algorithm with errors for approximating solution of the general variational inclusion, Principled analyses and design of first-order methods with inexact proximal operators, Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods, Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments, Modified proximal-point method for nonlinear complementarity problems, An LQP method for pseudomonotone variational inequalities, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, Re-examination of Bregman functions and new properties of their divergences, Pseudomonotone operators and the Bregman proximal point algorithm, Dykstras algorithm with bregman projections: A convergence proof, The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces, On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators, Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces, Interior proximal method without the cutting plane property, Unnamed Item, An APPA-based descent method with optimal step-sizes for monotone variational inequalities, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Nonlinear Forward-Backward Splitting with Projection Correction, An inexact proximal-type algorithm in Banach spaces, A generalized proximal-point-based prediction-correction method for variational inequality problems, A new generalized APPA for maximal monotone operators, Comparison of two proximal point algorithms for monotone variational inequalities, An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities, On inexact generalized proximal methods with a weakened error tolerance criterion, Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions, A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods, Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces, An approximate proximal-extragradient type method for monotone variational inequalities, A new relative error criterion for the proximal point algorithm, Strong convergence of a splitting algorithm for treating monotone operators, Extended auxiliary problem principle using Bregman distances, Interior proximal method for variational inequalities: Case of nonparamonotone operators, Interior Proximal Methods for equilibrium programming: part II, An interior proximal point algorithm for nonlinear complementarity problems, A general self-adaptive relaxed-PPA method for convex programming with linear constraints, A relaxed approximate proximal point algorithm, A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Modified approximate proximal point algorithms for finding roots of maximal monotone operators, Bregman-like functions and proximal methods for variational problems with nonlinear constraints, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, A new accuracy criterion for approximate proximal point algorithms, Double-regularization proximal methods, with complementarity applications, A variable metric proximal-descent algorithm for monotone operators, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, Bregman functions and auxiliary problem principle, Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design, A proximal point algorithm with asymmetric linear term, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, Proximal-point algorithm using a linear proximal term, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions, Proximal point algorithms for general variational inequalities, The indefinite proximal point algorithms for maximal monotone operators, Nonlinear proximal decomposition method for convex programming, A class of nonlinear proximal point algorithms for variational inequality problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auxiliary problem principle and decomposition of optimization problems
- Auxiliary problem principle extended to variational inequalities
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Proximal minimization algorithm with \(D\)-functions
- Enlargement of monotone operators with applications to variational inequalities
- Equilibrium programming using proximal-like algorithms
- Smooth methods of multipliers for complementarity problems
- On the twice differentiable cubic augmented Lagrangian
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
- Local boundedness of nonlinear, monotone operators
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Convex Analysis
- On the Maximality of Sums of Nonlinear Monotone Operators
