A path following interior-point method for linear complementarity problems over circular cones (Q1630229): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13160-018-0317-9 / 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/s13160-018-0317-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809449397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jordan algebraic structure of the circular cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual path-following algorithms for circular programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time interior-point method for circular cone programming based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of merit functions for the second-order cone complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth and nonsmooth analyses of vector-valued functions associated with circular cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / 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: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / 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: Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial interior-point algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2953984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards non-symmetric conic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Interior Point Method for Linear Complementarity Problems over 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 homogeneous interior-point algorithm for nonsymmetric convex conic optimization / 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: Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5495616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular cone convexity and some inequalities associated with circular cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational analysis of circular cone programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13160-018-0317-9 / rank
 
Normal rank

Latest revision as of 23:43, 10 December 2024

scientific article
Language Label Description Also known as
English
A path following interior-point method for linear complementarity problems over circular cones
scientific article

    Statements

    A path following interior-point method for linear complementarity problems over circular cones (English)
    0 references
    0 references
    7 December 2018
    0 references
    linear complementarity problem
    0 references
    circular cone
    0 references
    interior-point methods
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers