Pages that link to "Item:Q2477797"

The following pages link to Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function (Q2477797):

Displaying 12 items.

• Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization (Q335312) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← links)
• A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem (Q2269047) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• Some useful inequalities via trace function method in Euclidean Jordan algebras (Q2438327) (← links)
• A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)