A new one-step smoothing Newton method for second-order cone programming. (Q713481): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031624244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient support vector machine learning method with second-order cone programming for large-scale 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: 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: Interior point methods for second-order cone programming and OR applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / 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: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the convergence of non-interior point algorithms for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Magnetic Shield Design with Second-Order Cone Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762533 / rank
 
Normal rank

Latest revision as of 19:16, 5 July 2024

scientific article
Language Label Description Also known as
English
A new one-step smoothing Newton method for second-order cone programming.
scientific article

    Statements

    A new one-step smoothing Newton method for second-order cone programming. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2012
    0 references
    The paper deals with the second-order cone programming (SOCP) problem. The authors present a one-step smoothing Newton method for solving the SOCP problem based on a new smoothing function of the Fischer-Burmeister function. The algorithm solves only one system of linear equations and performs only one Armijo-type line-search per iteration. Global and local quadratic convergence under standard assumptions are proved. Numerical experiments demonstrate efficiency of the algorithm.
    0 references
    Fischer-Burmeister function
    0 references
    Euclidean Jordan algebra
    0 references
    smoothing Newton method
    0 references
    global convergence
    0 references
    local quadratic convergence
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references