Pages that link to "Item:Q5221274"
From MaRDI portal
The following pages link to The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming (Q5221274):
Displaying 9 items.
- The rate of convergence of proximal method of multipliers for second-order cone optimization problems (Q828665) (← links)
- The convergence of proximal methods to fixed points of extremal mappings and estimates of their rate of convergence (Q1921613) (← links)
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems (Q2193005) (← links)
- Convergence rate of a proximal multiplier algorithm for separable convex minimization (Q2970394) (← links)
- (Q4901199) (← links)
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization (Q4979868) (← links)
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm (Q5151507) (← links)
- Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367) (← links)
- The rate of convergence of proximal method of multipliers for nonlinear programming (Q5858993) (← links)