Spingarn's method and progressive decoupling beyond elicitable monotonicity
From MaRDI portal
Cites work
- A class of combined iterative methods for solving variational inequalities
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence of the Chambolle-Pock algorithm in the absence of monotonicity
- Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Extended monotropic programming and duality
- Finite-dimensional variational inequalities and complementarity problems. Vol. I.
- Geometric methods and applications. For computer science and engineering
- scientific article; zbMATH DE number 1187121 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Monotone (nonlinear) operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Partial inverse of a monotone operator
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Proximal Methods for Cohypomonotone Operators
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting
- Scaled relative graphs for nonmonotone operators with applications in circuit theory
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Variational convexity and the local monotonicity of subgradient mappings
This page was built for publication: Spingarn's method and progressive decoupling beyond elicitable monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444037)