Local convergence of an inexact-restoration method and numerical experiments
From MaRDI portal
Publication:850815
DOI10.1007/s10957-005-6537-6zbMath1116.90094OpenAlexW1984170737WikidataQ113106867 ScholiaQ113106867MaRDI QIDQ850815
Ernesto G. Birgin, José Mario Martínez
Publication date: 6 November 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-6537-6
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Inexact restoration for derivative-free expensive function minimization and applications, An inexact restoration strategy for the globalization of the sSQP method, Local convergence of an inexact-restoration method and numerical experiments, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, Constrained derivative-free optimization on thin domains, Nonmonotone inexact restoration approach for minimization with orthogonality constraints, On the sensitivity of a Euclidean projection, Inexact restoration and adaptive mesh refinement for optimal control, Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, Non-monotone inexact restoration method for nonlinear programming, Inexact restoration method for minimization problems arising in electronic structure calculations, On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors, Inexact restoration for Euler discretization of box-constrained optimal control problems, Euler discretization and inexact restoration for optimal control, Convergence of the forward-backward sweep method in optimal control, Assessing the reliability of general-purpose inexact restoration methods, Newton-type methods: a broader view, A new line search inexact restoration approach for nonlinear programming, Local convergence of filter methods for equality constrained non-linear programming, A filter algorithm: comparison with NLP solvers, On the Complexity of an Inexact Restoration Method for Constrained Optimization, On sequential optimality conditions for smooth constrained optimization, Global optimization of robust chance constrained problems, Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact, Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, A flexible inexact-restoration method for constrained optimization
Uses Software
Cites Work
- Local convergence of an inexact-restoration method and numerical experiments
- Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Inexact-restoration algorithm for constrained optimization
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
- Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5]
- Solving nonlinear simultaneous equations with a generalization of Brent's method
- Numerical Solution of Nonlinear Equations
- CUTE
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- A Globally Convergent Filter Method for Nonlinear Programming
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- Nonlinear programming without a penalty function.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
