Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
type: Item
instance of: scholarly article
title: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
zbMATH Open document ID: 1403.90618
author: Nadir Amaioua
author: Charles Audet
author: Andrew R. Conn
author: Sébastien Le Digabel
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6876684
zbMATH Keywords: nonlinear programming
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: quadratic programming
zbMATH Keywords: trust-region subproblem
zbMATH Keywords: mesh adaptive direct search
cites work: NOMAD
cites work: An Analog Solution of Programming Problems
cites work: A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
cites work: A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Derivative-Free and Blackbox Optimization
cites work: A mesh adaptive direct search algorithm for multiobjective optimization
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: A lower bound for the controlling parameters of the exact penalty functions
cites work: Second-order conditions for an exact penalty function
cites work: Nonlinear programming via an exact penalty function: Asymptotic analysis
cites work: Nonlinear programming via an exact penalty function: Global analysis
cites work: Constrained Optimization Using a Nondifferentiable Penalty Function
cites work: Q4023146
cites work: A note on exploiting structure when using slack variables
cites work: Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
cites work: Trust Region Methods
cites work: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Two-Step Algorithms for Nonlinear Optimization with Structured Applications
cites work: The trust region subproblem and semidefinite programming*
cites work: Solving structural engineering design optimization problems using an artificial bee colony algorithm
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: CUTEr and SifDec
cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
cites work: On solving trust-region and other regularised subproblems in optimization
cites work: Q3531415
cites work: Minimizing a quadratic over a sphere
cites work: Multiplier and gradient methods
cites work: Test examples for nonlinear programming codes
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: Algorithm 909
cites work: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
cites work: Computing a Trust Region Step
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Numerical Optimization
cites work: The generalized trust region subproblem
cites work: Q5590418
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Q3897937
cites work: An Exact Potential Method for Constrained Maxima
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Non-Linear Programming Via Penalty Functions
describes a project that uses: NOMAD
describes a project that uses: LANCELOT
describes a project that uses: GALAHAD
describes a project that uses: GQTPAR
describes a project that uses: CUTEr
describes a project that uses: Global Optimization Test
describes a project that uses: SifDec
describes a project that uses: Ipopt
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.10.058
OpenAlex ID: W2768407195
Wikidata QID: Q58201008
DOI: 10.1016/J.EJOR.2017.10.058