Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
DOI10.1007/s11228-018-0496-1OpenAlexW2898536162MaRDI QIDQ2281266
Publication date: 19 December 2019
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-018-0496-1
splittingproximal point algorithmaugmented Lagrangiansproblem decompositionprogressive hedgingmethod of partial inversesconvex/nonconvex optimizationelicitable convexityelicitable monotonicitylinkage problemsmonotone/nonmonotone variational inequalitiesprogressive decouplingproximal methods of multipliersvariational convexityvariational second-order sufficiency
Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- Monotone (nonlinear) operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convexification procedures and decomposition methods for nonconvex optimization problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Stochastic variational inequalities: single-stage to multistage
- Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging
- Minimizing buffered probability of exceedance by progressive hedging
- Variational convexity and the local monotonicity of subgradient mappings
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- On the maximal monotonicity of subdifferential mappings
- On a primal-proximal heuristic in discrete optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- A survey on operator splitting and decomposition of convex programs
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A Parallel Splitting Method for Coupled Monotone Inclusions
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Applications of the method of partial inverses to convex programming: Decomposition
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Tilt Stability of a Local Minimum
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Subgradient monotonicity and convex functions
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity