Pages that link to "Item:Q430935"
From MaRDI portal
The following pages link to Dual convergence for penalty algorithms in convex programming (Q430935):
Displaying 7 items.
- Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs (Q395589) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Proximal penalty-duality algorithms for mixed optimality conditions (Q1687158) (← links)
- Primal and dual convergence of a proximal point exponential penalty method for linear programming (Q1849261) (← links)
- Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems (Q3788600) (← links)
- On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs (Q4567169) (← links)
- Convergence rate estimates for penalty methods revisited (Q6133302) (← links)
