A homogeneous smoothing-type algorithm for symmetric cone linear programs
From MaRDI portal
Publication:477482
DOI10.1007/s10255-014-0409-5zbMath1327.90103OpenAlexW2007486185MaRDI QIDQ477482
Publication date: 9 December 2014
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-014-0409-5
Uses Software
Cites Work
- Unnamed Item
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Analysis of a smoothing method for symmetric conic linear programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- 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
- On homogeneous and self-dual algorithms for LCP
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On a homogeneous algorithm for the monotone complementarity problem
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
This page was built for publication: A homogeneous smoothing-type algorithm for symmetric cone linear programs
