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-8zbMath1251.90392OpenAlexW1977098426MaRDI QIDQ415402
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9938-8
kernel functioninterior point methodEuclidean Jordan algebralarge and small update methodssymmetric cone linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ 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 ⋮ The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ 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 ⋮ The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function ⋮ A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions ⋮ Unnamed Item ⋮ 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 ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones ⋮ Unnamed Item ⋮ A nonmonotone smoothing Newton method for circular cone programming ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ A projection and contraction method for symmetric cone complementarity problem ⋮ A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone. ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Monotone functions on formally real Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- 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
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- 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
- On a commutative class of search directions for linear programming over symmetric cones
- Self-regular functions and new search directions for linear and semidefinite optimization
- \(P_ *\)-matrices are just sufficient
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Function spaces and reproducing kernels on bounded symmetric domains
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
- A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- 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
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
- 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
- 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
- Interior Point Methods for Linear Optimization
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
