A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On second-order sufficient optimality conditions for <i>c</i> <sup>1,1</sup>-optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / 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: Semismooth and Semiconvex Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704489 / 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: Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On concepts of directional differentiability / 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: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise Ck functions in nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of Locally Lipschitzian Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Equations: Motivation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for quadratic stochastic programs with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epigraphical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of variable metric proximal methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming / rank
 
Normal rank

Latest revision as of 17:04, 23 May 2024

scientific article
Language Label Description Also known as
English
A globally convergent Newton method for convex \(SC^ 1\) minimization problems
scientific article

    Statements

    A globally convergent Newton method for convex \(SC^ 1\) minimization problems (English)
    0 references
    0 references
    0 references
    0 references
    4 September 1995
    0 references
    0 references
    Newton method
    0 references
    globally convergent and locally superlinearly convergent method
    0 references
    convex minimization
    0 references
    semismooth but nondifferentiable gradient
    0 references
    nonlinear minimax problems
    0 references
    stochastic programs with recourse
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references