scientific article; zbMATH DE number 6847407
From MaRDI portal
Publication:4604968
Recommendations
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- A weighted-path-following method for symmetric cone linear complementarity problems
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian P_* ()-LCP over symmetric cones
- A corrector-predictor interior-point algorithm for P_()-HLCPs over Cartesian product of symmetric cones
- A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
Cites work
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A weighted-path-following method for linear optimization
- An infeasible interior point method for linear complementarity problems over symmetric cones
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 934836 (Why is no real title available?)
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- New interior point algorithms in linear programming
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Similarity and other spectral relations for symmetric cones
- Two interior-point methods for nonlinear P_*()-complementarity problems.
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604968)
