Pages that link to "Item:Q2916483"
From MaRDI portal
The following pages link to A primal-dual infeasible interior-point algorithm for second-order cone programming (Q2916483):
Displaying 12 items.
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- An infeasible-interior-point predictor-corrector algorithm for the second-order cone program (Q1003972) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- The primal-dual second-order cone approximations algorithm for symmetric cone programming (Q2385532) (← links)
- An infeasible interior-point algorithm for stochastic second-order cone optimization (Q2420786) (← links)
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming (Q2895672) (← links)
- A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming (Q3629526) (← links)
- A primal–dual interior point method for nonlinear optimization over second-order cones (Q3632943) (← links)
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming (Q4504779) (← links)
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming (Q4638909) (← links)
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
