Results 21 to 30 of about 62,722 (247)

The Second-Order Shape Derivative of Kohn–Vogelius-Type Cost Functional Using the Boundary Differentiation Approach

open access: yesMathematics, 2014
A shape optimization method is used to study the exterior Bernoulli free boundaryproblem. We minimize the Kohn–Vogelius-type cost functional over a class of admissibledomains subject to two boundary value problems. The first-order shape derivative of the
Jerico B. Bacani, Gunther Peichl
doaj   +1 more source

Derivative-Free Optimal Iterative Methods

open access: yesComputational Methods in Applied Mathematics, 2010
AbstractIn this study, we develop an optimal family of derivative-free iterative methods. Convergence analysis shows that the methods are fourth order convergent, which is also verified numerically. The methods require three functional evaluations during each iteration. Though the methods are independent of derivatives, computa-
Khattri, S. K., Agarwal, R. P.
openaire   +2 more sources

Benchmarking Derivative-Free Optimization Algorithms [PDF]

open access: yesSIAM Journal on Optimization, 2009
We propose data profiles as a tool for analyzing the performance of derivative-free optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and ...
Jorge J. Moré, Stefan M. Wild
openaire   +1 more source

Survey of derivative-free optimization

open access: yesNumerical Algebra, Control & Optimization, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xi, Min, Sun, Wenyu, Chen, Jun
openaire   +3 more sources

Derivative-free neural network for optimizing the scoring functions associated with dynamic programming of pairwise-profile alignment

open access: yesAlgorithms for Molecular Biology, 2018
Background A profile-comparison method with position-specific scoring matrix (PSSM) is among the most accurate alignment methods. Currently, cosine similarity and correlation coefficients are used as scoring functions of dynamic programming to calculate ...
Kazunori D. Yamada
doaj   +1 more source

Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis Function Surrogate Models

open access: yesMathematical and Computational Applications, 2021
We present a local trust region descent algorithm for unconstrained and convexly constrained multiobjective optimization problems. It is targeted at heterogeneous and expensive problems, i.e., problems that have at least one objective function that is ...
Manuel Berkemeier, Sebastian Peitz
doaj   +1 more source

Data-Driven-Model-Based Full-Region Optimal Mapping Method of Permanent Magnet Synchronous Motors in Wide Temperature Range

open access: yesMachines, 2023
To improve the motor efficiency and expand the actual external characteristic region of electric vehicle permanent magnet synchronous motor (PMSM) drive systems, the optimal operation of mapping torque to d-q axis current is usually applied. Nevertheless,
Yuanjun Bian   +4 more
doaj   +1 more source

Beam Line Optimization using Derivative-Free Algorithms

open access: yesJournal of Physics: Conference Series, 2019
Abstract The present study focuses on the beam line optimization from the heavy-ion synchrotron SIS18 to the HADES experiment. BOBYQA (Bound Optimization BY Quadratic Approximation) solves bound constrained optimization problems without using derivatives of the objective function.
Appel, Sabrina, Reimann, Stephan
openaire   +2 more sources

Compact Model Parameter Extraction via Derivative-Free Optimization

open access: yesIEEE Access
In this paper, we address the problem of compact model parameter extraction to simultaneously extract tens of parameters via derivative-free optimization.
Rafael Perez Martinez   +6 more
doaj   +1 more source

Construction of Optimal Derivative‐Free Techniques without Memory [PDF]

open access: yesJournal of Applied Mathematics, 2012
Construction of iterative processes without memory, which are both optimal according to the Kung‐Traub hypothesis and derivative‐free, is considered in this paper. For this reason, techniques with four and five function evaluations per iteration, which reach to the optimal orders eight and sixteen, respectively, are discussed theoretically.
Soleymani, F.   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy