Optimizing partially separable functions without derivatives
From MaRDI portal
Publication:5717536
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
Cites work
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Analysis of Generalized Pattern Searches
- CUTEr and SifDec
- Computational aspects of multivariate polynomial interpolation
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- Direct search methods: Then and now
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Exploiting band structure in unconstrained optimization without derivatives
- Generalized descent for global optimization
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Local convergence analysis for partitioned quasi-Newton updates
- On the Convergence of Pattern Search Algorithms
- On trust region methods for unconstrained minimization without derivatives
- Partitioned variable metric updates for large structured optimization problems
- Trust Region Methods
- UOBYQA: unconstrained optimization by quadratic approximation
Cited in
(13)- 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
- Exploiting Problem Structure in Derivative Free Optimization
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Survey of derivative-free optimization
- Derivative-free optimization methods
- A trust-region framework for derivative-free mixed-integer optimization
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- 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
- 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
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)
