Extension of smoothing Newton algorithms to solve linear programming over symmetric cones

DOI10.1007/s11424-011-8045-0zbMath1242.90100OpenAlexW2004331813MaRDI QIDQ545466

Zheng-Hai Huang, Xiao-Hong Liu

Publication date: 22 June 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-011-8045-0

zbMATH Keywords

linear programmingsymmetric conesmoothing algorithmEuclidean Jordan algebra

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones, A homogeneous smoothing-type algorithm for symmetric cone linear programs, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization, The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem, A one-parametric class of smoothing functions for second-order cone programming, A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search, A nonmonotone smoothing Newton algorithm for weighted complementarity problem

Uses Software

• SCCP
• SDPT3

Cites Work

• Unnamed Item
• Some P-properties for linear transformations on Euclidean Jordan algebras
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• Analysis of a smoothing method for symmetric conic linear programming
• A smoothing-type algorithm for solving system of inequalities
• Smoothing algorithms for complementarity problems over symmetric cones
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Euclidean Jordan algebras and interior-point algorithms
• Non-interior continuation methods for solving semidefinite complementarity problems
• Non-interior continuation method for solving the monotone semidefinite complementarity problem
• Extension of primal-dual interior point algorithms to symmetric cones
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones