Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
From MaRDI portal
(Redirected from Publication:5958076)
Recommendations
- Non-monotone inexact restoration method for nonlinear programming
- scientific article; zbMATH DE number 2221957
- A new line search inexact restoration approach for nonlinear programming
- A flexible inexact-restoration method for constrained optimization
- An inexact restoration derivative-free filter method for nonlinear programming
Cites work
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- A trust region algorithm for equality constrained optimization
- A Trust-Region SLCP Model Algorithm for Nonlinear Programming
- Inexact-restoration algorithm for constrained optimization
- Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
- Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
- Nonlinear programming without a penalty function.
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- 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
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Two-phase model algorithm with global convergence for nonlinear programming
Cited in
(57)- A filter inexact-restoration method for nonlinear programming
- Two-phase model algorithm with global convergence for nonlinear programming
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- An interior-point method for solving box-constrained underdetermined nonlinear systems
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate.
- Inexact restoration for Euler discretization of box-constrained optimal control problems
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
- 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
- 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
- The demand adjustment problem via inexact restoration method
- Assessing the reliability of general-purpose inexact restoration methods
- Newton-type methods: a broader view
- A flexible inexact-restoration method for constrained optimization
- Sequential equality-constrained optimization for nonlinear programming
- An inexact restoration strategy for the globalization of the sSQP method
- Constrained derivative-free optimization on thin domains
- Bilevel optimization with a multiobjective problem in the lower level
- Global convergence of a general filter algorithm based on an efficiency condition of the step
- Euler discretization and inexact restoration for optimal control
- 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
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- Inexact restoration approach for minimization with inexact evaluation of the objective function
- On the sensitivity of a Euclidean projection
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Local convergence of filter methods for equality constrained non-linear programming
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Inexact restoration and adaptive mesh refinement for optimal control
- 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
- Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration
- Inexact restoration method for nonlinear optimization without derivatives
- A stochastic local search algorithm for constrained continuous global optimization
- An inexact restoration derivative-free filter method for nonlinear programming
- On the complexity of an inexact restoration method for constrained optimization
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact
- On second-order optimality conditions for nonlinear programming
- A filter algorithm: comparison with NLP solvers
- scientific article; zbMATH DE number 2221957 (Why is no real title available?)
- On sequential optimality conditions for smooth constrained optimization
- Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
- On approximate KKT condition and its extension to continuous variational inequalities
- A novel sequential optimality condition for smooth constrained optimization and algorithmic consequences
- Improving the global convergence of inexact restoration methods for constrained optimization problems
- Inexact-restoration modelling with monotone interpolation and parameter estimation
- An inexact-restoration method for nonlinear bilevel programming problems
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Local convergence of an inexact-restoration method and numerical experiments
- Global convergence of slanting filter methods for nonlinear programming
- A new line search inexact restoration approach for nonlinear programming
This page was built for publication: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958076)