Pages that link to "Item:Q1404230"

The following pages link to Extension of primal-dual interior point algorithms to symmetric cones (Q1404230):

Displaying 50 items.

• Exceptional family and solvability of the second-order cone complementarity problems (Q278403) (← links)
• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
• The algebraic structure of the arbitrary-order cone (Q289064) (← links)
• Decomposition-based interior point methods for stochastic quadratic second-order cone programming (Q298535) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
• Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← 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)
• The Hölder continuity of Löwner's operator in Euclidean Jordan algebras (Q395833) (← links)
• Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
• A regularized smoothing Newton method for solving the symmetric cone complementarity problem (Q409946) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• More results on Schur complements in Euclidean Jordan algebras (Q452344) (← links)
• Homogeneous self-dual algorithms for stochastic second-order cone programming (Q467475) (← links)
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
• A homogeneous smoothing-type algorithm for symmetric cone linear programs (Q477482) (← 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 large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← 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)
• An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
• Convergence of a non-interior continuation algorithm for the monotone SCCP (Q601939) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• A predictor-corrector smoothing Newton method for symmetric cone complementarity problems (Q613219) (← links)
• Stationary point conditions for the FB merit function associated with symmetric cones (Q613328) (← links)
• An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• The \(Q\) method for symmetric cone programming (Q639204) (← 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)
• Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras (Q655979) (← links)
• Improved smoothing Newton methods for symmetric cone complementarity problems (Q691381) (← links)
• The same growth of FB and NR symmetric cone complementarity functions (Q691418) (← links)
• Some P-properties for linear transformations on Euclidean Jordan algebras (Q703633) (← links)
• Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
• Bilinear optimality constraints for the cone of positive polynomials (Q717131) (← 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 full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras (Q846306) (← links)
• Analysis of a smoothing method for symmetric conic linear programming (Q854421) (← links)
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)