نتایج جستجو برای: derivative free line saerch

تعداد نتایج: 958053  

Journal: :international journal of nano dimension 0
s. r. kargirwar nanotechnology lab, department of chemistry, science college, congress nagar, nagpur-12, india. s. r. thakare nanotechnology lab, department of chemistry, science college, congress nagar, nagpur-12, india. m. d. choudhary b. d. college of engineering, sevagram, wardha, india. d. k. burghate department of physics, science college, congress nagar, nagpur-12, india.

the study reports some preliminary investigations on the template free synthesis of a scantly investigated polyaniline (pani) derivative-phenylenediamine (pda) by template free method in the presence of oxalic acid (oa) (dopant), using ammonium persulfate as oxidant. polymerization of phenylenediamine (pda) was confirmed by the ft-ir as well as uv–visible studies. the morphology of phenylenedia...

2012
Kevin G. Jamieson Robert D. Nowak Benjamin Recht

This paper provides lower bounds on the convergence rate of Derivative Free Optimization (DFO) with noisy function evaluations, exposing a fundamental and unavoidable gap between the performance of algorithms with access to gradients and those with access to only function evaluations. However, there are situations in which DFO is unavoidable, and for such situations we propose a new DFO algorit...

Journal: :J. Optimization Theory and Applications 2015
Angelo Ciccazzo Vittorio Latorre Giampaolo Liuzzi Stefano Lucidi Francesco Rinaldi

In this paper, we introduce a framework for derivative-free robust optimization based on the use of an efficient derivative-free optimization routine for mixed integer nonlinear problems. The proposed framework is employed to find a robust optimal design of a particular integrated circuit (namely a DC-DC converter commonly used in portable electronic devices). The proposed robust optimization a...

Journal: :Comp. Opt. and Appl. 2007
Luigi Grippo Marco Sciandrone

In this paper we study nonmonotone globalization techniques, in connection with iterative derivative-free methods for solving a system of nonlinear equations in several variables. First we define and analyze a class of nonmonotone derivative-free linesearch techniques for uncon-strained minimization of differentiable functions. Then we introduce a globalization scheme, which combines nonmonoton...

Journal: :J. Optimization Theory and Applications 2014
Warren Hare Yves Lucet

Derivative-Free Optimization (DFO) examines the challenge of minimizing (or maximizing) a function without explicit use of derivative information. Many standard techniques in DFO are based on using model functions to approximate the objective function, and then applying classic optimization methods on the model function. For example, the details behind adapting steepest descent, conjugate gradi...

2012
A. L. Custódio J. F. A. Madeira

In practical applications it is common to have several conflicting objective functions to optimize. Frequently, these functions are nondifferentiable or discontinuous, could be subject to numerical noise and/or be of black-box type, preventing the use of derivative-based techniques. In this paper we give an overview of some recent developments in Derivative-free Multiobjective Optimization. We ...

D. K. Burghate M. D. Choudhary S. R. Kargirwar S. R. Thakare,

The study reports some preliminary investigations on the template free synthesis of a scantly investigated polyaniline (PANI) derivative-Phenylenediamine (PDA) by template free method in the presence of Oxalic acid (OA) (dopant), using Ammonium Persulfate as oxidant. Polymerization of Phenylenediamine (PDA) was confirmed by the FT-IR as well as UV–visible studies. The morphology of Phenylenedia...

2007
Árpád Bűrmen Tadej Tuma

We present an algorithmic framework for unconstrained derivative-free optimization based on dividing the search space in regions (partitions). Every partition is assigned a representative point. The representative points form a grid. A piece-wise constant approximation to the function subject to optimization is constructed using a partitioning and its corresponding grid. The convergence of the ...

1994
J. E. Dennis Virginia J. Torczon

There have been interesting recent developments in methods for solving optimization problems without making use of derivative (sensitivity) information. While calculus based methods that employ derivative information can be extremely eecient and very eeec-tive, they are not applicable to all MDO problems, for instance, when the function to be optimized is nondiierentiable, when sensitivity info...

Journal: :Math. Program. 2002
Stefano Lucidi Marco Sciandrone Paul Tseng

We propose feasible descent methods for constrained minimization that do not make explicit use of objective derivative information. The methods at each iteration sample the objective function value along a finite set of feasible search arcs and decrease the sampling stepsize if an improved objective function value is not sampled. The search arcs are obtained by projecting search direction rays ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید