Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
From MaRDI portal
Publication:4944413
DOI10.1080/02331939808844409zbMath0974.90024OpenAlexW2014666597MaRDI QIDQ4944413
Publication date: 16 December 2001
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939808844409
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Nonmonotonic trust region algorithm
- Partial linearization methods in nonlinear programming
- A class of gap functions for variational inequalities
- Nonmonotone stabilization methods for nonlinear equations
- Decomposition methods for differentiable optimization problems over Cartesian product sets
- Nonmonotone curvilinear line search methods for unconstrained optimization
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- A class on nonmonotone stabilization methods in unconstrained optimization
- Characterization of the subdifferentials of convex functions
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Minimization of Locally Lipschitzian Functions
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Quasi-Newton Methods, Motivation and Theory
- Generalized equations and their solutions, Part I: Basic theory
- Merit functions and descent algorithms for a class of variational ineqality problems
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Convex Analysis
