A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
From MaRDI portal
Publication:415402
DOI10.1007/S10957-011-9938-8zbMATH Open1251.90392OpenAlexW1977098426MaRDI QIDQ415402FDOQ415402
Recommendations
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A new polynomial interior-point algorithm for the Cartesian \(P_\ast(\kappa)\) second-order cone linear complementarity problem
- Kernel-based interior-point methods for Cartesian \(P_*(\kappa)\)-linear complementarity problems over symmetric cones
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
Cites work
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A continuation method for nonlinear complementarity problems over symmetric cones
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Euclidean Jordan algebras and interior-point algorithms
- Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Function spaces and reproducing kernels on bounded symmetric domains
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems
- Interior Point Methods for Linear Optimization
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Monotone functions on formally real Jordan algebras
- Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- On a commutative class of search directions for linear programming over symmetric cones
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- Smoothing functions for second-order-cone complementarity problems
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- \(P_ *\)-matrices are just sufficient
Cited in
(39)- A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- A path following interior-point method for linear complementarity problems over circular cones
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
- A full-Newton step feasible interior-point algorithm for solving the general Fisher market equilibrium
- Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A nonmonotone smoothing Newton method for circular cone programming
- Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- Infeasible Mehrotra-type predictor-corrector algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A modified infeasible interior-point algorithm for \(P_\ast(\kappa)\)-HLCP over symmetric cones
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- Kernel-based interior-point methods for Cartesian \(P_*(\kappa)\)-linear complementarity problems over symmetric cones
- scientific article; zbMATH DE number 6847407 (Why is no real title available?)
- scientific article; zbMATH DE number 2195332 (Why is no real title available?)
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone.
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- 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
- A projection and contraction method for symmetric cone complementarity problem
- A new polynomial interior-point algorithm for the Cartesian \(P_\ast(\kappa)\) second-order cone linear complementarity problem
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
This page was built for publication: A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415402)
