Several Jordan-algebraic aspects of optimization†

DOI10.1080/02331930701523510zbMath1191.90034OpenAlexW2090158630MaRDI QIDQ3507703

Leonid Faybusovich

Publication date: 20 June 2008

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701523510

zbMATH Keywords

optimizationinterior-point algorithmsJordan algebras

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Jordan algebras (algebras, triples and pairs) (17C99)

Related Items

Jordan-algebraic aspects of optimization: randomization, Todd's maximum-volume ellipsoid problem on symmetric cones, A bound on the Carathéodory number, Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations, Error bounds, facial residual functions and applications to the exponential cone, Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems, Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions, Extended commutation principles for normal decomposition systems, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Self-Dual Polyhedral Cones and Their Slack Matrices, An extension of Chubanov's algorithm to symmetric cones, Amenable cones: error bounds without constraint qualifications, Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, Refinements of Ky Fan's eigenvalue inequality for simple Euclidean Jordan algebras by using gradients of K-increasing functions

Cites Work

• Unnamed Item
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• On a commutative class of search directions for linear programming over symmetric cones
• Jordan-algebraic aspects of nonconvex optimization over symmetric cones
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Jordan‐Algebraic Approach to Convexity Theorems for Quadratic Mappings
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• A long-step primal--dual algorithm for the symmetric programming problem
• A Jordan-algebraic approach to potential-reduction algorithms