A filled function approach for nonsmooth constrained global optimization.
Wang, Weixiang, Shang, Youlin, Zhang, Ying (2010)
Mathematical Problems in Engineering
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Diagonal Numerical Methods for Solving Lipschitz Global Optimization Problems”
A filled function approach for nonsmooth constrained global optimization.
État de l'art des méthodes “d'optimisation globale”
Gérard Berthiau, Patrick Siarry (2010)
RAIRO - Operations Research
Similarity:
We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this...
Variationally-derived limited-memory methods for unconstrained optimization
Vlček, Jan, Lukšan, Ladislav
Similarity:
On an optimization problem described by some integral equations
Pelczewski, Jerzy (2015-11-28T13:30:03Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
On approximating NP-hard optimization problems.
Håstad, Johan (1998)
Documenta Mathematica
Similarity:
On a method of optimization
S. Grzegórski, H. Popławska (1974)
Applicationes Mathematicae
Similarity:
Finding global minima with a filled function approach for non-smooth global optimization.
Wang, Weixiang, Shang, Youlin, Zhang, Ying (2010)
Discrete Dynamics in Nature and Society
Similarity:
A method of scalarization of Bacopoulos und Singer in vectorial optimization
Rzepecka, Genowefa (2015-11-10T13:18:06Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
New technique for solving univariate global optimization
Djamel Aaid, Amel Noui, Mohand Ouanes (2017)
Archivum Mathematicum
Similarity:
In this paper, a new global optimization method is proposed for an optimization problem with twice differentiable objective function a single variable with box constraint. The method employs a difference of linear interpolant of the objective and a concave function, where the former is a continuous piecewise convex quadratic function underestimator. The main objectives of this research are to determine the value of the lower bound that does not need an iterative local optimizer. The...
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)
I. Charon, O. Hudry (2009)
RAIRO - Operations Research
Similarity:
An Optimization Procedure for Water Reservoir Planning
Serafim Opricović, Lorenzo Eccher, Miodrag Isailovski (1991)
The Yugoslav Journal of Operations Research
Similarity:
High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems
Roman Dębski (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far). The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an...