On the cutting plane property and the Bregman proximal point algorithm
From MaRDI portal
Publication:5199367
nonconvex optimizationvariational inequalitiesproximal point algorithmpseudomonotone operatorsBregman distancescutting plane property
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Recommendations
- Pseudomonotone operators and the Bregman proximal point algorithm
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
- On some properties of generalized proximal point methods for variational inequalities
Cited in
(6)- Cutting plane algorithms and approximate lower subdifferentiability
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- An interior proximal method for a class of quasimonotone variational inequalities
- Interior proximal methods for quasiconvex optimization
- Interior proximal method without the cutting plane property
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
This page was built for publication: On the cutting plane property and the Bregman proximal point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199367)
