Jordan-algebraic aspects of nonconvex optimization over symmetric cones

DOI10.1007/s00245-005-0835-0zbMath1094.90031OpenAlexW2153123126MaRDI QIDQ2492877

Leonid Faybusovich, Ye Lu

Publication date: 15 June 2006

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00245-005-0835-0

zbMATH Keywords

nonconvex optimizationJordan algebrassymmetric conepotential-reduction algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51) Jordan algebras (algebras, triples and pairs) (17C99)

Related Items (16)

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions ⋮ Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity ⋮ A semismooth Newton method for nonlinear symmetric cone programming ⋮ Several Jordan-algebraic aspects of optimization† ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ Extension of primal-dual interior point methods to diff-convex problems on symmetric cones ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ Complementarity properties of the Lyapunov transformation over symmetric cones ⋮ A new class of complementarity functions for symmetric cone complementarity problems ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ 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

This page was built for publication: Jordan-algebraic aspects of nonconvex optimization over symmetric cones