A simple canonical form for nonlinear programming problems and its use
From MaRDI portal
Publication:2420791
DOI10.1007/s10957-018-1381-7zbMath1414.90328arXiv1803.11304OpenAlexW2963181054WikidataQ129399510 ScholiaQ129399510MaRDI QIDQ2420791
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.11304
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The divergence of the BFGS and Gauss Newton methods
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- The BFGS method with exact line searches fails for non-convex objective functions
- An extension of Yuan's lemma and its applications in optimization
- On a conjecture in second-order optimality conditions
- On the divergence of line search methods
- Newton's iterates can converge to non-stationary points
- The Affine Scaling Algorithm Fails for Stepsize 0.999
- On second-order optimality conditions for nonlinear programming
- On the mapping of quadratic forms
This page was built for publication: A simple canonical form for nonlinear programming problems and its use