Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
From MaRDI portal
Recommendations
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- A smoothing Newton method for symmetric cone complementarity problems
- A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
- A smoothing Newton method for symmetric cone complementarity problem
- Improved smoothing Newton methods for symmetric cone complementarity problems
- A smoothing inexact Newton method for symmetric cone complementarity problems
- A new smoothing Newton method for symmetric cone complementarity problems
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- A smoothing Newton method for the Cartesian \(P_0\)-LCP over symmetric cones
- Smoothing Newton methods for symmetric cone linear complementarity problem with the Cartesian \(P/P_0\)-property
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A smoothing-type algorithm for solving system of inequalities
- Analysis of a smoothing method for symmetric conic linear programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- 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
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Non-interior continuation method for solving the monotone semidefinite complementarity problem
- Non-interior continuation methods for solving semidefinite complementarity problems
- 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
- Semismooth and Semiconvex Functions in Constrained Optimization
- Smoothing algorithms for complementarity problems over symmetric cones
- Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
- Some P-properties for linear transformations on Euclidean Jordan algebras
Cited in
(14)- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A semismooth Newton method for nonlinear symmetric cone programming
- A homogeneous smoothing-type algorithm for symmetric cone linear programs
- A smoothing Newton method for the Cartesian \(P_0\)-LCP over symmetric cones
- Analysis of a smoothing method for symmetric conic linear programming
- A one-parametric class of smoothing functions for second-order cone programming
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming
- The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- A non-monotone smoothing Newton algorithm for SCLP based on a scaled central path
This page was built for publication: Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545466)
