Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank

DOI10.1007/s10107-003-0424-4zbMath1035.90099OpenAlexW2000296233MaRDI QIDQ1403299

Takashi Tsuchiya, Leonid Faybusovich

Publication date: 1 September 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0424-4

zbMATH Keywords

infinite dimensional JB-algebras of finite rankpolynomial-time primal-dual algorithms

Mathematics Subject Classification ID

Interior-point methods (90C51) Programming in abstract spaces (90C48) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) General theory of topological algebras with involution (46K05)

Related Items

Inverse conic linear programs in Banach spaces, Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems, Estimation of normal covariance matrices parametrized by irreducible symmetric cones under Stein's loss, Hilbert's projective metric on Lorentz cones and Birkhoff formula for Lorentzian compressions, Several Jordan-algebraic aspects of optimization†, Non-Euler-Lagrangian Pareto-optimality conditions for dynamic multiple criterion decision problems, Improved smoothing Newton methods for symmetric cone complementarity problems, Smoothing algorithms for complementarity problems over symmetric cones, A merit function method for infinite-dimensional SOCCPs, Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones, Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems, Multi-target linear-quadratic control problem and second-order cone programming, Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem, Numerical experiments with universal barrier functions for cones of Chebyshev systems, A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones, On Hazan's algorithm for symmetric programming problems