Optimizing partially separable functions without derivatives
From MaRDI portal
Publication:5717536
DOI10.1080/10556780500140227zbMath1152.90659OpenAlexW2150051236WikidataQ58185806 ScholiaQ58185806MaRDI QIDQ5717536
Benoît Colson, Phillipe L. Toint
Publication date: 10 January 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500140227
multivariate interpolationderivative-free optimizationpartially separable functionstrust-region algorithms
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Survey of derivative-free optimization, Exploiting Problem Structure in Derivative Free Optimization, Scalable subspace methods for derivative-free nonlinear least-squares optimization, On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure, Derivative free optimization methods for optimizing stirrer configurations, Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization, Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint, Exploiting problem structure in pattern search methods for unconstrained optimization, Derivative-free optimization methods, An affine-scaling derivative-free trust-region method for solving nonlinear systems subject to linear inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Generalized descent for global optimization
- Partitioned variable metric updates for large structured optimization problems
- On trust region methods for unconstrained minimization without derivatives
- Direct search methods: Then and now
- Local convergence analysis for partitioned quasi-Newton updates
- UOBYQA: unconstrained optimization by quadratic approximation
- Exploiting band structure in unconstrained optimization without derivatives
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Computational aspects of multivariate polynomial interpolation
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- On the Convergence of Pattern Search Algorithms
- Analysis of Generalized Pattern Searches
- Trust Region Methods
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- CUTEr and SifDec
