On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
From MaRDI portal
Publication:4785871
DOI10.1137/S1052623497330392zbMath1027.90112MaRDI QIDQ4785871
Stefano Lucidi, Marco Sciandrone
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)
Related Items
Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, A non-monotone pattern search approach for systems of nonlinear equations, Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique, Survey of derivative-free optimization, Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods, Extended global convergence framework for unconstrained optimization, Derivative-free methods for mixed-integer nonsmooth constrained optimization, Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems, Nonmonotone derivative-free methods for nonlinear equations, Exploiting Problem Structure in Derivative Free Optimization, Derivative-free optimization: a review of algorithms and comparison of software implementations, A subclass of generating set search with convergence to second-order stationary points, Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization, New global optimization methods for ship design problems, Unit commitment in oligopolistic markets by nonlinear mixed variable programming, Adapting derivative free optimization methods to engineering models with discrete variables, THB-splines multi-patch parameterization for multiply-connected planar domains via template segmentation, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, A derivative-free nonmonotone line-search technique for unconstrained optimization, A generating set search method using curvature information, A decomposition algorithm for unconstrained optimization problems with partial derivative information, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints, Numerical nonlinear observers using pseudo-Newton-type solvers, Simulation optimization: a review of algorithms and applications, Derivative-free optimization methods, A Derivative-Free Method for Structured Optimization Problems, Derivative free methodologies for circuit worst case analysis, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Uses Software
