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