Pages that link to "Item:Q1330895"
From MaRDI portal
The following pages link to A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895):
Displayed 35 items.
- The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets (Q535723) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- Fast minimization methods for solving constrained total-variation superresolution image reconstruction (Q632177) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- Alternating direction method for bi-quadratic programming (Q652699) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
- Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
- Inexact proximal point method for general variational inequalities (Q852837) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators (Q1265027) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- New decomposition methods for solving variational inequality problems. (Q1410985) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization (Q2430823) (← links)
- An inexact proximal-type algorithm in Banach spaces (Q2465461) (← links)
- Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
- Modified approximate proximal point algorithms for finding roots of maximal monotone operators (Q2501443) (← links)
- Decomposition for structured convex programs with smooth multiplier methods (Q2572336) (← links)
- Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662) (← links)
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework (Q4657707) (← links)
- Convergence analysis of a proximal newton method<sup>1</sup> (Q4714551) (← links)
- An improved contraction method for structured monotone variational inequalities (Q5505149) (← links)
- A descent method for structured monotone variational inequalities (Q5758226) (← links)
- A decomposition method for convex minimization problems and its application. (Q5931895) (← links)
- A new accuracy criterion for approximate proximal point algorithms (Q5955039) (← links)