Results 11 to 20 of about 131,594 (222)

A directional Gaussian smoothing optimization method for computational inverse design in nanophotonics

open access: yesMaterials & Design, 2021
Local-gradient-based optimization approaches lack nonlocal exploration ability required for escaping from local minima in non-convex landscapes. A directional Gaussian smoothing (DGS) approach was proposed in our recent work and used to define a truly ...
Jiaxin Zhang, Sirui Bi, Guannan Zhang
doaj   +1 more source

Global Continuous Optimization with Error Bound and Fast Convergence [PDF]

open access: yes, 2015
This paper considers global optimization with a black-box unknown objective function that can be non-convex and non-differentiable. Such a difficult optimization problem arises in many real-world applications, such as parameter tuning in machine learning,
Kawaguchi, Kenji   +2 more
core   +2 more sources

Error assessment of biogeochemical models by lower bound methods (NOMMA-1.0) [PDF]

open access: yesGeoscientific Model Development, 2018
Biogeochemical models, capturing the major feedbacks of the pelagic ecosystem of the world ocean, are today often embedded into Earth system models which are increasingly used for decision making regarding climate policies. These models contain poorly
V. Sauerland   +5 more
doaj   +1 more source

On Some Hadamard-Type Inequalities for Convex Functions On A Rectangular Box

open access: yesJournal of Nonlinear Analysis and Application, 2011
In this paper some Hadamard-type inequalities for convex functions of 3-variables on a rectanguler box are given. We also define a mapping related to convex functions on a rectanguler box.
Ozdemir, M. E., Akdemir, Ahmet Ocak
openaire   +2 more sources

A theoretical framework for supervised learning from regions [PDF]

open access: yes, 2013
Supervised learning is investigated, when the data are represented not only by labeled points but also labeled regions of the input space. In the limit case, such regions degenerate to single points and the proposed approach changes back to the ...
Adams   +29 more
core   +1 more source

Uncertainty analysis of torque-induced bending deformations in ball screw systems

open access: yesAdvances in Mechanical Engineering, 2015
In order to study the torque-induced bending deformation in ball screw systems with uncertain-but-bounded parameters, uncertainty analysis of torque-induced bending deformations in ball screw systems based on an numerical method combined second-order ...
Gao Xiangsheng, Wang Min, Li Qi, Zan Tao
doaj   +1 more source

Approximate Dynamic Programming via Sum of Squares Programming [PDF]

open access: yes, 2012
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables.
Kamgarpour, Maryam   +5 more
core   +1 more source

Betting on Quantum Objects [PDF]

open access: yes, 2017
Dutch book arguments have been applied to beliefs about the outcomes of measurements of quantum systems, but not to beliefs about quantum objects prior to measurement. In this paper, we prove a quantum version of the probabilists' Dutch book theorem that
Steeger, Jeremy
core   +4 more sources

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding [PDF]

open access: yes, 2016
Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by ...
Benavoli, Alessio, Piga, Dario
core   +2 more sources

Convex Relaxation Regression: Black-Box Optimization of Smooth Functions by Learning Their Convex Envelopes

open access: yes, 2016
Finding efficient and provable methods to solve non-convex optimization problems is an outstanding challenge in machine learning and optimization theory. A popular approach used to tackle non-convex problems is to use convex relaxation techniques to find a convex surrogate for the problem.
Azar, Mohammad Gheshlaghi   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy