A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Guo-Qiang Wang / rank | |||
Property / author | |||
Property / author: Yan-Qin Bai / rank | |||
Property / author | |||
Property / author: Guo-Qiang Wang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Yan-Qin Bai / rank | |||
Normal rank | |||
Property / review text | |||
The aim of the authors is to extend the interior point algorithms for linear optimization and sufficient linear complementarity problems based on the kernel functions to the Cartesian P-matrix linear complementarity problem over symmetric cones. The difficulty of the extension is that a symmetric cone is nonpolyhedral. In that purpose, the authors introduced a new class of polynomial interior point algorithms based on a parametric kernel function which is fairly general and covers a wide range of kernel functions, including the classical logarithmic kernel function, the prototype self-regular functions and also non-self-regular functions. This parametric kernel function determines both search directions and the proximity measure between the iterates and the central path. The Nesterov and Todd scaling scheme is used to get the symmetrization of the search directions. Finally, by using Euclidean Jordan algebras, the authors derive the iteration bounds that match the currently best known iteration bounds for large and small update methods, which reduce the gap between the practical behavior and the theoretical iteration bounds. | |||
Property / review text: The aim of the authors is to extend the interior point algorithms for linear optimization and sufficient linear complementarity problems based on the kernel functions to the Cartesian P-matrix linear complementarity problem over symmetric cones. The difficulty of the extension is that a symmetric cone is nonpolyhedral. In that purpose, the authors introduced a new class of polynomial interior point algorithms based on a parametric kernel function which is fairly general and covers a wide range of kernel functions, including the classical logarithmic kernel function, the prototype self-regular functions and also non-self-regular functions. This parametric kernel function determines both search directions and the proximity measure between the iterates and the central path. The Nesterov and Todd scaling scheme is used to get the symmetrization of the search directions. Finally, by using Euclidean Jordan algebras, the authors derive the iteration bounds that match the currently best known iteration bounds for large and small update methods, which reduce the gap between the practical behavior and the theoretical iteration bounds. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C51 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C33 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6031747 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
symmetric cone linear complementarity problem | |||
Property / zbMATH Keywords: symmetric cone linear complementarity problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Euclidean Jordan algebra | |||
Property / zbMATH Keywords: Euclidean Jordan algebra / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
kernel function | |||
Property / zbMATH Keywords: kernel function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
interior point method | |||
Property / zbMATH Keywords: interior point method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
large and small update methods | |||
Property / zbMATH Keywords: large and small update methods / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jean Jacques Strodiot / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SCCP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-011-9938-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977098426 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a commutative class of search directions for linear programming over symmetric cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(P_ *\)-matrices are just sufficient / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smoothing Functions for Second-Order-Cone Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Euclidean Jordan algebras and interior-point algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth behavior of two classes of merit functions for symmetric cone complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5453751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Function spaces and reproducing kernels on bounded symmetric domains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone functions on formally real Jordan algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Jordan-algebraic approach to potential-reduction algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior Point Methods for Linear Optimization / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:39, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones |
scientific article |
Statements
A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (English)
0 references
8 May 2012
0 references
The aim of the authors is to extend the interior point algorithms for linear optimization and sufficient linear complementarity problems based on the kernel functions to the Cartesian P-matrix linear complementarity problem over symmetric cones. The difficulty of the extension is that a symmetric cone is nonpolyhedral. In that purpose, the authors introduced a new class of polynomial interior point algorithms based on a parametric kernel function which is fairly general and covers a wide range of kernel functions, including the classical logarithmic kernel function, the prototype self-regular functions and also non-self-regular functions. This parametric kernel function determines both search directions and the proximity measure between the iterates and the central path. The Nesterov and Todd scaling scheme is used to get the symmetrization of the search directions. Finally, by using Euclidean Jordan algebras, the authors derive the iteration bounds that match the currently best known iteration bounds for large and small update methods, which reduce the gap between the practical behavior and the theoretical iteration bounds.
0 references
symmetric cone linear complementarity problem
0 references
Euclidean Jordan algebra
0 references
kernel function
0 references
interior point method
0 references
large and small update methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references