Pages that link to "Item:Q734862"

The following pages link to A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862):

Displaying 46 items.

• A new non-interior continuation method for solving the second-order cone complementarity problem (Q273303) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
• An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
• A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
• New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
• A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
• A generalized direction in interior point method for monotone linear complementarity problems (Q1733321) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems (Q2511086) (← links)
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
• A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization (Q2795090) (← links)
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
• A corrector–predictor path-following method for second-order cone optimization (Q2958275) (← 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)
• (Q4577944) (← links)
• New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization (Q4595149) (← links)
• (Q4604968) (← links)
• New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function (Q4622797) (← links)
• Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
• New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization (Q4987772) (← links)
• A new full-NT step interior-point method for circular cone optimization (Q5147630) (← links)
• An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
• An extension for identifying search directions for interior-point methods in linear optimization (Q5213020) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
• Interior-point algorithm for linear programming based on a new descent direction (Q6140958) (← links)
• Corrector-predictor interior-point method with new search direction for semidefinite optimization (Q6159295) (← links)
• A class of new search directions for full-NT step feasible interior point method in semidefinite optimization (Q6186557) (← links)
• A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)
• Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems (Q6596331) (← links)