Analysis of a smoothing method for symmetric conic linear programming

DOI10.1007/BF02896466MaRDI QIDQ854421zbMATH OpenFDO

Authors Yong-Jin Liu, Yin-He Wang, Liwei Zhang

Publication date 4 December 2006

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming in abstract spaces (90C48)

Recommendations

• Smoothing method for mathematical programs with symmetric cone complementarity constraints
• A homogeneous smoothing-type algorithm for symmetric cone linear programs
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
• Smoothing methods for convex inequalities and linear complementarity problems
• Smoothing algorithms for complementarity problems over symmetric cones
• On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
• Analysis of smoothing-type algorithms for the convex second-order cone programming
• Smoothed Analysis of the Simplex Method
• A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone

Cites work

• scientific article; zbMATH DE number 1306986 (Why is no real title available?)
• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1538165 (Why is no real title available?)
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
• Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Non-interior continuation methods for solving semidefinite complementarity problems
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• Smoothing functions for second-order-cone complementarity problems
• Smoothing methods for convex inequalities and linear complementarity problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Some P-properties for linear transformations on Euclidean Jordan algebras

Cited in

(18)

• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A new smoothing Newton-type method for second-order cone programming problems
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
• Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
• Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
• A predictor-corrector smoothing Newton method for symmetric cone complementarity problems
• Analysis on the smoothing method for the \(P\)-linear complementarity systems
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
• A homogeneous smoothing-type algorithm for symmetric cone linear programs
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
• Convergence of a non-interior continuation algorithm for the monotone SCCP
• Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
• A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
• Analysis of a non-interior continuation method for second-order cone programming
• Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
• A non-monotone smoothing Newton algorithm for SCLP based on a scaled central path

This page was built for publication: Analysis of a smoothing method for symmetric conic linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854421)