A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

Title not available (Why is that?)
A unified approach to interior point algorithms for linear complementarity problems: A summary
Self-regular functions and new search directions for linear and semidefinite optimization
$P_ *$-matrices are just sufficient
Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
Polynomial interior-point algorithms for $P_*(\kappa )$ horizontal linear complementarity problem
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Smoothing functions for second-order-cone complementarity problems
A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
A class of polynomial interior-point algorithms for the Cartesian $P_{*}(\kappa )$ second-order cone linear complementarity problem
Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
Path-following interior point algorithms for the Cartesian $P_{*}(\kappa )$-LCP over symmetric cones
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Euclidean Jordan algebras and interior-point algorithms
Extension of primal-dual interior point algorithms to symmetric cones
Function spaces and reproducing kernels on bounded symmetric domains
A Jordan-algebraic approach to potential-reduction algorithms
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Interior Point Methods for Linear Optimization
Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
On a commutative class of search directions for linear programming over symmetric cones
Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
Primal-Dual Interior-Point Methods for Self-Scaled Cones
Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
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 Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
Monotone functions on formally real Jordan algebras
A regularization method for the second-order cone complementarity problem with the Cartesian $P_0$-property
Growth behavior of two classes of merit functions for symmetric cone complementarity problems
Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
Predictor-corrector algorithm for solving $P_ *(\kappa)$-matrix LCP from arbitrary positive starting points
Cartesian $P$-property and its applications to the semidefinite linear complementarity problem
Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP

Cited In (33)

Large-update interior point algorithm for $P_*$-linear complementarity problem
Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras
Title not available (Why is that?)
A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
A full step infeasible interior-point method for Cartesian $P_{*}(\kappa)$-SCLCP
A class of polynomial interior-point algorithms for the Cartesian $P_{*}(\kappa )$ second-order cone linear complementarity problem
A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
The parameter-Newton iteration for the second-order cone linear complementarity problem
Title not available (Why is that?)
A generalized smoothing Newton method for the symmetric cone complementarity problem
A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone.
An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
New complexity analysis of interior-point methods for the Cartesian $P_\ast ({\kappa})$-SCLCP
A primal-dual large-update interior-point algorithm for $P_*(\kappa)$-LCP based on a new class of kernel functions
Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
A modified infeasible interior-point algorithm for $P_\ast(\kappa)$-HLCP over symmetric cones
A projection and contraction method for symmetric cone complementarity problem
A nonmonotone smoothing Newton method for circular cone programming
Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP_*(κ)-LCP Over Symmetric Cones
Title not available (Why is that?)
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
A class of path-following interior-point methods for $P_*(\kappa)$-horizontal linear complementarity problems
A wide neighborhood interior-point method for Cartesian $P_*(\kappa )$-LCP over symmetric cones
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones
The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
A new polynomial interior-point algorithm for the Cartesian $P_\ast(\kappa)$ second-order cone linear complementarity problem

Uses Software

SCCP

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)