Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of Quasi-Newton Methods for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Quadratic Programming with Penalization of the Displacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential quadratic programming method for potentially infeasible mathematical programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sequential quadratic programming method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive quadratic programming algorithm with global and superlinear convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally Convergent Newton Methods for Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Sequential Quadratic Programming Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive quadratic programming algorithm that uses differentiable exact penalty functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for nonlinearly constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semismooth equation approach to the solution of nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-type method for positive-semidefinite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the resolution of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the generalized complementarity problem to differentiable unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method for B-Differentiable Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of quasi-Newton methods for B-differentiable equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized Newton method and a quasi-Newton method for nonsmooth equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified BFGS method and its global convergence in nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods / rank
 
Normal rank

Latest revision as of 19:32, 3 June 2024

scientific article; zbMATH DE number 1638276
Language Label Description Also known as
English
Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
scientific article; zbMATH DE number 1638276

    Statements

    Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2001
    0 references
    The authors propose a Broyder-Fletcher-Goldfarb-Shanno method for solving the Karush-Kuhn-Tucker system of a constrained optimization problem with finitely many variables, equality and inequality constraints, where all functions are assumed to be twice continuously differentiable. The method is based on a nonsmooth equation reformulation of the KKT system in terms of the Fisher-Burmeister function. Under some conditions the method is well defined and converges globally and superlinearly to a KKT point without any convexity assumptions on the problem. This paper is clearly written and ends with a useful discussion of the method. From the paper it is not clear how restrictive the conditions are that lead to global or superlinear convergence. Imbedding of this paper in the existing research on this subject is adequate, and the paper ends with an extensive list of references.
    0 references
    0 references
    nonsmooth programming
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    Broyder-Fletcher-Goldfarb-Shanno method
    0 references
    Karush-Kuhn-Tucker system
    0 references
    constrained optimization
    0 references
    nonsmooth equation
    0 references
    Fisher-Burmeister function
    0 references
    0 references
    0 references