Pages that link to "Item:Q5231367"
From MaRDI portal
The following pages link to Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367):
Displaying 3 items.
- Local convergence of tensor methods (Q2133417) (← links)
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems (Q2193005) (← links)
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems (Q6601206) (← links)