Pages that link to "Item:Q1378999"

The following pages link to Linear systems in Jordan algebras and primal-dual interior-point algorithms (Q1378999):

Displaying 50 items.

• Exceptional family and solvability of the second-order cone complementarity problems (Q278403) (← 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)
• 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)
• 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 new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
• An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
• A new class of complementarity functions for symmetric cone complementarity problems (Q537637) (← links)
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← 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)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Improved smoothing Newton methods for symmetric cone complementarity problems (Q691381) (← 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 new class of smoothing complementarity functions over symmetric cones (Q720236) (← 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)
• 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)
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
• Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
• A one-parametric class of merit functions for the symmetric cone complementarity problem (Q1018348) (← links)
• A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search (Q1041534) (← links)
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← links)
• Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
• On a commutative class of search directions for linear programming over symmetric cones (Q1599289) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
• On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints (Q1717009) (← links)
• An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• On max-\(k\)-sums (Q1785208) (← links)