Pages that link to "Item:Q4320797"
From MaRDI portal
The following pages link to The convergence of a modified barrier method for convex programming (Q4320797):
Displayed 9 items.
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- The Newton modified barrier method for QP problems (Q1915923) (← links)
- Support vector machine via nonlinear rescaling method (Q2468778) (← links)
- The Legendre Transformation in Modern Optimization (Q2957720) (← links)
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization (Q4960453) (← links)
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)
- Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)