UOBYQA: unconstrained optimization by quadratic approximation
From MaRDI portal
A new algorithm for general unconstrained optimization calculations is described. It takes account of the curvature of the objective function by forming quadratic models by interpolation. Obviously, no first derivatives are required. A typical iteration of the algorithm generates a new vector of variables either by minimizing the quadratic model subject to a trust region bound, or by a procedure that should improve the accuracy of the model. The paper addresses the initial positions of the interpolation points and the adjustment of trust region radii. The algorithm works with the Lagrange functions of the interpolation equations explicitly; therefore their coefficients are updated when an interpolation point is moved. The Lagrange functions assist the procedure that improves the model and also they provide an estimate of the error of the quadratic approximation of the function being minimized. It is pointed out that results are very promising for functions with less than twenty variables.
Recommendations
- A q-conjugate gradient algorithm for unconstrained optimization problems
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- scientific article; zbMATH DE number 1461863
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
- A robustification approach in unconstrained quadratic optimization
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
- An unconstrained convex programming approach to solving convex quadratic programming problems
Cited in
(98)- A study on concave optimization via canonical dual function
- Stochastic optimization using a trust-region method and random models
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Compositions of convex functions and fully linear models
- On the construction of quadratic models for derivative-free trust-region algorithms
- An adaptive framework for costly black-box global optimization based on radial basis function interpolation
- Childcare and commitment within households
- On the convergence of the UOBYQA method
- Constrained optimization involving expensive function evaluations: A sequential approach
- Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
- UOBYQA
- SMGO: a set membership approach to data-driven global optimization
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients
- Efficient unconstrained black box optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\)
- A derivative-free Gauss-Newton method
- A derivative-free algorithm for spherically constrained optimization
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Recent advances in trust region algorithms
- A wedge trust region method with self-correcting geometry for derivative-free optimization
- Optimization with hidden constraints and embedded Monte Carlo computations
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A quasi-multistart framework for global optimization of expensive functions using response surface models
- Nonlinear optimization with GAMS /LGO
- On the use of simplex methods in constructing quadratic models
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Numerical aspects of searching convective/absolute instability transition
- On the Lagrange functions of quadratic models that are defined by interpolation*
- Non-intrusive termination of noisy optimization
- A new direct search method based on separable fractional interpolation model
- Stochastic derivative-free optimization using a trust region framework
- Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- A derivative-free comirror algorithm for convex optimization
- Developments of NEWUOA for minimization without derivatives
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization
- A derivative-free algorithm for linearly constrained optimization problems
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Penalty-free method for nonsmooth constrained optimization via radial basis functions
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
- Model building with likelihood basis pursuit
- On the use of quadratic models in unconstrained minimization without derivatives
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
- Anisotropic diffusion in consensus-based optimization on the sphere
- Large-scale history matching with quadratic interpolation models
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- GPU parameter tuning for tall and skinny dense linear least squares problems
- Black-Box Optimization: Methods and Applications
- Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
- scientific article; zbMATH DE number 6318818 (Why is no real title available?)
- An initialization strategy for high-dimensional surrogate-based expensive black-box optimization
- Derivative-free optimization methods
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- An algorithm for minimizing clustering functions
- Max–min separability
- The NEWUOA software for unconstrained optimization without derivatives
- Constrained global optimization of expensive black box functions using radial basis functions
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- Optimizing partially separable functions without derivatives
- On the existence of affine invariant descent directions
- Efficient numerical methods for the optimisation of large kinetic reaction mechanisms
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
- Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information
- Hyperparameter autotuning of programs with HybridTuner
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
- A subset-selection-based derivative-free optimization algorithm for dynamic operation optimization in a steel-making process
- A derivative-free optimization algorithm combining line-search and trust-region techniques
- A metamodel-assisted evolutionary algorithm for expensive optimization
- Constructing composite search directions with parameters in quadratic interpolation models
- New subspace method for unconstrained derivative-free optimization
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models
- An optimal interpolation set for model-based derivative-free optimization methods
- Stochastic zeroth order descent with structured directions
- Effective matrix adaptation strategy for noisy derivative-free optimization
- The limitation of neural nets for approximation and optimization
- Least H^2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms
- An improved randomized algorithm with noise level tuning for large-scale noisy unconstrained DFO problems
- Derivative-free optimization with transformed objective functions and the algorithm based on the least Frobenius norm updating quadratic model
- A derivative-free geometric algorithm for optimization on a sphere
- A derivative-free method using a new underdetermined quadratic interpolation model
- Algorithm 1053: SOLNP+: a derivative-free solver for constrained nonlinear optimization
- A survey of trust-region radius update mechanisms. Part I: First-order analysis
- A globally convergent trust-region algorithm for unconstrained derivative-free optimization
- Survey of derivative-free optimization
- A discussion on variational analysis in derivative-free optimization
- Improved strategies for radial basis function methods for global optimization
- Parallel radial basis function methods for the global optimization of expensive functions
- Variable-number sample-path optimization
- Global optimization by canonical dual function
This page was built for publication: UOBYQA: unconstrained optimization by quadratic approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849505)
