Bregman-like functions and proximal methods for variational problems with nonlinear constraints
From MaRDI portal
Recommendations
- Bregman functions and auxiliary problem principle
- On some properties of generalized proximal point methods for variational inequalities
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Extended auxiliary problem principle using Bregman distances
- Interior proximal method for variational inequalities: Case of nonparamonotone operators
Cites work
- -enlargements of maximal monotone operators in Banach spaces
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- Convergence analysis of non-quadratic proximal methods for variational inequalities in Hilbert spaces
- Enlargement of monotone operators with applications to variational inequalities
- Extended auxiliary problem principle using Bregman distances
- scientific article; zbMATH DE number 1268621 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- Interior proximal method for variational inequalities: Case of nonparamonotone operators
- On inexact generalized proximal methods with a weakened error tolerance criterion
- On the Maximality of Sums of Nonlinear Monotone Operators
- Proximal-based regularization methods and successive approximation of variational inequalities in Hilbert spaces
Cited in
(13)- Interior proximal method for variational inequalities: Case of nonparamonotone operators
- Pseudomonotone operators and the Bregman proximal point algorithm
- Bregman type regularization of variational inequalities with Mosco approximation of the constraint set
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- The extragradient method for solving variational inequalities in the presence of computational errors
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Interior proximal method without the cutting plane property
- On the cutting plane property and the Bregman proximal point algorithm
- Bregman functions and auxiliary problem principle
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
- An interior proximal method in vector optimization
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
This page was built for publication: Bregman-like functions and proximal methods for variational problems with nonlinear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758218)