Optimizing partially separable functions without derivatives
DOI10.1080/10556780500140227zbMATH Open1152.90659DBLPjournals/oms/ColsonT05OpenAlexW2150051236WikidataQ58185806 ScholiaQ58185806MaRDI QIDQ5717536FDOQ5717536
Authors: Benoît Colson, Philippe L. Toint 
Publication date: 10 January 2006
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500140227
Recommendations
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- A derivative-free algorithm based on simple model for unconstrained optimization
- scientific article; zbMATH DE number 3898623
multivariate interpolationderivative-free optimizationpartially separable functionstrust-region algorithms
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Partitioned variable metric updates for large structured optimization problems
- Local convergence analysis for partitioned quasi-Newton updates
- CUTEr and SifDec
- UOBYQA: unconstrained optimization by quadratic approximation
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Trust Region Methods
- On the Convergence of Pattern Search Algorithms
- Direct search methods: Then and now
- Generalized descent for global optimization
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Analysis of Generalized Pattern Searches
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- On trust region methods for unconstrained minimization without derivatives
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Computational aspects of multivariate polynomial interpolation
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- Exploiting band structure in unconstrained optimization without derivatives
Cited In (13)
- Survey of derivative-free optimization
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- Exploiting Problem Structure in Derivative Free Optimization
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- A trust-region framework for derivative-free mixed-integer optimization
- Derivative free optimization methods for optimizing stirrer configurations
- An affine-scaling derivative-free trust-region method for solving nonlinear systems subject to linear inequality constraints
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Derivative-free optimization methods
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
Uses Software
This page was built for publication: Optimizing partially separable functions without derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717536)
