Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems
DOI10.1007/978-3-319-57099-0_69zbMath1368.65090OpenAlexW2606714721MaRDI QIDQ5275008
Publication date: 7 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57099-0_69
algorithmsystem of nonlinear equationsnumerical testsnonlinear programmingnonlinear complementarity problemsuperlinear convergencevariational inequality problemgeneralized Newton methodunconstrained optimization problemsB-differential
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Unnamed Item
- Some quadrature-based versions of the generalized Newton method for solving nonsmooth equations
- Variants of Newton's method for functions of several variables
- More test examples for nonlinear programming codes
- Secant methods for semismooth equations
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Newton methods for solving nonsmooth equations via a new subdifferential
- A nonsmooth version of Newton's method
- On Characterizations of P- and P 0-Properties in Nonsmooth Functions
- Optimization and nonsmooth analysis
- A New Class of Augmented Lagrangians in Nonlinear Programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- An algorithm for LC1 optimization
- Globally convergent inexact generalized Newton's methods for nonsmooth equations
This page was built for publication: Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems
