Pages that link to "Item:Q4785875"

The following pages link to Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities (Q4785875):

Displaying 34 items.

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
• A new non-interior continuation method for solving the second-order cone complementarity problem (Q273303) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
• A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
• A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← links)
• A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization (Q2009732) (← links)
• A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions (Q2442632) (← links)
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems (Q2511086) (← links)
• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
• A corrector–predictor path-following method for second-order cone optimization (Q2958275) (← links)
• Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677) (← links)
• A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
• An adaptive self-regular proximity-based large-update IPM for LO (Q5312761) (← links)
• On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem (Q5401695) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
• A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)