Pages that link to "Item:Q1849261"
From MaRDI portal
The following pages link to Primal and dual convergence of a proximal point exponential penalty method for linear programming (Q1849261):
Displayed 10 items.
- Coupling the gradient method with a general exterior penalization scheme for convex minimization (Q415412) (← links)
- Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's (Q642609) (← links)
- Iterative regularization via dual diagonal descent (Q1703168) (← links)
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems (Q1746707) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Subdivision scheme tuning around extraordinary vertices (Q2388581) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's (Q3225086) (← links)
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)