Pages that link to "Item:Q4389195"

The following pages link to Primal-Dual Interior-Point Methods for Self-Scaled Cones (Q4389195):

Displaying 50 items.

• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
• An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
• A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• Homogeneous self-dual algorithms for stochastic second-order cone programming (Q467475) (← links)
• A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
• An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← 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 primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← 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 new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• On central-path proximity measures in interior-point methods (Q850820) (← links)
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
• A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
• Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
• Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
• Numerical experiments with universal barrier functions for cones of Chebyshev systems (Q1029624) (← links)
• Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
• On the long-step path-following method for semidefinite programming (Q1273093) (← links)
• Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)