Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones

DOI10.1287/MOOR.26.3.543.10582zbMath1073.90572OpenAlexW2112332902MaRDI QIDQ2757681

Farid Alizadeh, Stefan Schmieta

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.26.3.543.10582

zbMATH Keywords

Semidefinite programming, interior point methods, symmetric cones, Euclidean Jordan algebras

Mathematics Subject Classification ID

Interior-point methods (90C51) Finite-dimensional structures of Jordan algebras (17C55) Power-associative rings (17A05)

Related Items (72)

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones ⋮ An algorithm for nonsymmetric conic optimization inspired by MOSEK ⋮ The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones ⋮ A method for weighted projections to the positive definite cone ⋮ A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function ⋮ Derivatives of eigenvalues and Jordan frames ⋮ Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems ⋮ Two classes of merit functions for the second-order cone complementarity problem ⋮ On the symmetry of induced norm cones ⋮ The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone ⋮ An alternating direction method for convex quadratic second-order cone programming with bounded constraints ⋮ Applications of second-order cone programming ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A primal-dual symmetric relaxation for homogeneous conic systems ⋮ Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity ⋮ Solving conic systems via projection and rescaling ⋮ Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization ⋮ A semismooth Newton method for nonlinear symmetric cone programming ⋮ Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming ⋮ Full Nesterov-Todd step infeasible interior-point method for symmetric optimization ⋮ The \(Q\) method for symmetric cone programming ⋮ The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ The solution set structure of monotone linear complementarity problems over second-order cone ⋮ A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem ⋮ A homogeneous smoothing-type algorithm for symmetric cone linear programs ⋮ A weighted-path-following method for symmetric cone linear complementarity problems ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems ⋮ On the approximate augmented Lagrangian for nonlinear symmetric cone programming ⋮ Interior Point Methods for Nonlinear Optimization ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function ⋮ A descent method for a reformulation of the second-order cone complementarity problem ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming ⋮ A corrector-predictor path-following method for convex quadratic symmetric cone optimization ⋮ A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions ⋮ On \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order cone ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ Product-form Cholesky factorization in interior point methods for second-order cone programming ⋮ A globally convergent non-interior point algorithm with full Newton step for second-order cone programming ⋮ Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem ⋮ An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ Random projections for conic programs ⋮ A modified LM algorithm for tensor complementarity problems over the circular cone ⋮ An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions ⋮ A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function ⋮ A one-parametric class of merit functions for the symmetric cone complementarity problem ⋮ Similarity and other spectral relations for symmetric cones ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search ⋮ Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones ⋮ An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function ⋮ SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ On the optimal parameter of a self-concordant barrier over a symmetric cone ⋮ An unconstrained smooth minimization reformulation of the second-order cone complementarity problem ⋮ A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming ⋮ On a commutative class of search directions for linear programming over symmetric cones

This page was built for publication: Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones