Pages that link to "Item:Q5933827"
From MaRDI portal
The following pages link to New complexity analysis of the primal-dual Newton method for linear optimization (Q5933827):
Displaying 23 items.
- A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
- On central-path proximity measures in interior-point methods (Q850820) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163) (← links)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations (Q2116587) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP (Q2263027) (← links)
- An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
- A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)
- A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
- An easy way to teach interior-point methods. (Q5932020) (← links)
- Convergence of the primal-dual Newton method for linear programming problems (Q5932901) (← links)
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888) (← links)
