Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
From MaRDI portal
Publication:5958076
DOI10.1023/A:1017567113614zbMath1052.90089OpenAlexW1535877357WikidataQ113098041 ScholiaQ113098041MaRDI QIDQ5958076
Publication date: 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017567113614
Related Items
Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate., Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, Inexact restoration for derivative-free expensive function minimization and applications, An inexact-restoration method for nonlinear bilevel programming problems, Sequential equality-constrained optimization for nonlinear programming, An inexact restoration strategy for the globalization of the sSQP method, Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, 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, Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems, On the sensitivity of a Euclidean projection, Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization, 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, Inexact restoration with subsampled trust-region methods for finite-sum minimization, A penalty-free method with superlinear convergence for equality constrained optimization, Non-monotone inexact restoration method for nonlinear programming, Inexact restoration method for minimization problems arising in electronic structure calculations, Bilevel optimization with a multiobjective problem in the lower level, A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold, The demand adjustment problem via inexact restoration method, 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, On approximate KKT condition and its extension to continuous variational inequalities, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, Global convergence of a general filter algorithm based on an efficiency condition of the step, Global convergence of slanting filter methods for nonlinear programming, Inexact restoration method for nonlinear optimization without derivatives, Euler discretization and inexact restoration for optimal control, An inexact restoration derivative-free filter method for nonlinear programming, Assessing the reliability of general-purpose inexact restoration methods, An interior-point method for solving box-constrained underdetermined nonlinear systems, Newton-type methods: a broader view, On second-order optimality conditions for nonlinear programming, A stochastic local search algorithm for constrained continuous global optimization, A new line search inexact restoration approach for nonlinear programming, A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations, Inexact Restoration approach for minimization with inexact evaluation of the objective function, Local convergence of filter methods for equality constrained non-linear programming, A trust-region SQP method without a penalty or a filter for nonlinear programming, A line search SQP method without a penalty or a filter, 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, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, A filter inexact-restoration method for nonlinear programming, Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact, A flexible inexact-restoration method for constrained optimization
Cites Work
- Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- A trust region algorithm for equality constrained optimization
- Two-phase model algorithm with global convergence for nonlinear programming
- Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
- 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 problems
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A Trust-Region SLCP Model Algorithm for Nonlinear Programming
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Nonlinear programming without a penalty function.
