A Jordan-algebraic approach to potential-reduction algorithms
From MaRDI portal
Publication:5957309
DOI10.1007/s002090100286zbMath0996.65065OpenAlexW2016700492MaRDI QIDQ5957309
Publication date: 23 June 2002
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002090100286
Jordan-algebraic techniquelinear monotone complementarity problemprimal-dual potential-reduction algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Jordan algebras (algebras, triples and pairs) (17C99)
Related Items
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, Interior-point methods based on kernel functions for symmetric optimization, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, Jordan-algebraic aspects of optimization: randomization, Rank computation in Euclidean Jordan algebras, Todd's maximum-volume ellipsoid problem on symmetric cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, Derivatives of eigenvalues and Jordan frames, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, An inexact interior point method for the large-scale simulation of granular material, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, Polynomial time solvability of non-symmetric semidefinite programming, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, Several Jordan-algebraic aspects of optimization†, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP, An extension of Chubanov's algorithm to symmetric cones, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones, A new infeasible interior-point method based on Darvay's technique for symmetric optimization, 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 large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, An extended Lie--Trotter formula and its applications, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, An infeasible full-NT step interior point algorithm for CQSCO, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, On self-regular IPMs (with comments and rejoinder), A long-step primal--dual algorithm for the symmetric programming problem, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Gaddum's test for symmetric cones, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, 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, 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, Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, Unnamed Item, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, Similarity and other spectral relations for symmetric cones, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function, Unnamed Item
