Pages that link to "Item:Q2757681"

The following pages link to Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. (Q2757681):

Displaying 50 items.

• The algebraic structure of the arbitrary-order cone (Q289064) (← 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)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← 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 polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← 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)
• 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)
• Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
• A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
• The solution set structure of monotone linear complementarity problems over second-order cone (Q924890) (← 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)
• Applications of second-order cone programming (Q1124764) (← links)
• Linear systems in Jordan algebras and primal-dual interior-point algorithms (Q1378999) (← links)
• Euclidean Jordan algebras and interior-point algorithms (Q1383772) (← links)
• Extension of primal-dual interior point algorithms to symmetric cones (Q1404230) (← 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)
• The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems (Q1625774) (← links)
• An alternating direction method for convex quadratic second-order cone programming with bounded constraints (Q1665536) (← links)
• Solving conic systems via projection and rescaling (Q1683682) (← links)
• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems (Q1715729) (← links)
• On \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order cone (Q1774962) (← links)
• Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
• Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity (Q1928546) (← links)
• A semismooth Newton method for nonlinear symmetric cone programming (Q1935944) (← links)
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• Random projections for conic programs (Q2040548) (← links)
• A modified LM algorithm for tensor complementarity problems over the circular cone (Q2043190) (← links)
• On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems (Q2247895) (← links)
• Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming (Q2257767) (← links)
• A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
• A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)