Pages that link to "Item:Q4785871"

The following pages link to On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization (Q4785871):

Displayed 30 items.

• New global optimization methods for ship design problems (Q374643) ‎ (← links)
• Unit commitment in oligopolistic markets by nonlinear mixed variable programming (Q374676) ‎ (← links)
• Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) ‎ (← links)
• A decomposition algorithm for unconstrained optimization problems with partial derivative information (Q691378) ‎ (← links)
• Survey of derivative-free optimization (Q827577) ‎ (← links)
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods (Q828735) ‎ (← links)
• A derivative-free nonmonotone line-search technique for unconstrained optimization (Q935796) ‎ (← links)
• THB-splines multi-patch parameterization for multiply-connected planar domains via template segmentation (Q1713121) ‎ (← links)
• Extended global convergence framework for unconstrained optimization (Q1882487) ‎ (← links)
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) ‎ (← links)
• Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) ‎ (← links)
• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (Q2218908) ‎ (← links)
• Derivative free methodologies for circuit worst case analysis (Q2329675) ‎ (← links)
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (Q2358022) ‎ (← links)
• Nonmonotone derivative-free methods for nonlinear equations (Q2385543) ‎ (← links)
• Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) ‎ (← links)
• Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) ‎ (← links)
• A generating set search method using curvature information (Q2457951) ‎ (← links)
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) ‎ (← links)
• On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) ‎ (← links)
• A subclass of generating set search with convergence to second-order stationary points (Q2926059) ‎ (← links)
• Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique (Q3161144) ‎ (← links)
• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems (Q3458824) ‎ (← links)
• Numerical nonlinear observers using pseudo-Newton-type solvers (Q3626934) ‎ (← links)
• A Derivative-Free Method for Structured Optimization Problems (Q4987276) ‎ (← links)
• A non-monotone pattern search approach for systems of nonlinear equations (Q5031793) ‎ (← links)
• Exploiting Problem Structure in Derivative Free Optimization (Q5066599) ‎ (← links)
• Derivative-free optimization methods (Q5230522) ‎ (← links)
• Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization (Q5437525) ‎ (← links)
• Simulation optimization: a review of algorithms and applications (Q5919176) ‎ (← links)