
KELLEY
 Referenced in 643 articles
[sw04829]
 pages, is devoted to the optimization of smooth functions. The methods studied in this first ... globalize convergence, i.e., remove the restriction that the starting point of the optimization iteration ... long, deals with the optimization of noisy functions. Such optimization problems arise, e.g., when ... treatment of both, optimization methods for smooth and for noisy functions is a unique feature...

AMIGO
 Referenced in 10 articles
[sw02425]
 AMIGO is an algorithm for solving smooth global optimization problems over ndimensional boxes...

SCCP
 Referenced in 79 articles
[sw03318]
 contains many optimization problems as special cases. Based on a general smoothing function, we propose ... algebras, we show that the algorithm is globally linearly and locally quadratically convergent under suitable...

TINKER
 Referenced in 11 articles
[sw04095]
 Boltzmann calculations, efficient truncated Newton (TNCG) local optimization, surface areas and volumes with derivatives, simple ... algorithm, our potential smoothing and search (PSS) methods for global optimization, Monte Carlo Minimization...

hydroPSO
 Referenced in 2 articles
[sw24340]
 optim’ R function for (global) optimization of nonsmooth and nonlinear functions. However...

LONE
 Referenced in 6 articles
[sw18211]
 presented aimed to solving L1penalized optimal control problems governed by unitaryoperator quantum spin ... strategy that includes a globalized semismooth Krylov–Newton scheme and a continuation procedure. Results ... LONE code in computing accurate sparse optimal control solutions...

MrDIRECT
 Referenced in 12 articles
[sw12380]
 global optimization problems. Although DIRECT global optimization algorithm quickly gets close to the basin ... behavior of DIRECT is similar to the “smooth mode phenomenon” encountered when solving linear systems ... case of PDE, this smooth mode phenomenon can be eliminated efficiently by the multigrid algorithm ... terms of the speed with which the global optimum is found to a high degree...

SDMINMAX
 Referenced in 12 articles
[sw36992]
 optimality conditions. In this work we define a new derivativefree algorithm which is globally ... convert the original problem into a smooth one by using a smoothing technique based...

MOIF
 Referenced in 8 articles
[sw36989]
 derivativefree methods for box constrained multiobjective optimization. The method that we propose ... multiobjective case. Global convergence results are stated under smooth assumptions on the objective functions...

OQNLP
 Referenced in 2 articles
[sw07548]
 heuristic algorithm designed to find global optima of smooth constrained nonlinear programs (NLPs) and mixed ... integer nonlinear programs (MINLPs), in cooperation with Optimal Methods, Inc. The multistart feature calls ... feasible solutions as well as the optimal point. The starting points are calculated from scatter ... options guarantee that a global optimum is obtained, however the likelihood is high. The OQNLP...

Emmentaltype GKLS
 Referenced in 3 articles
[sw39659]
 Emmentaltype GKLSbased multiextremal smooth test problems with nonlinear constraints. In this paper ... problems for methods solving constrained Lipschitz global optimization problems are proposed. A new class...

RPSALG
 Referenced in 9 articles
[sw12637]
 unified framework for penalty and smoothing methods for solving minmax convex semiinfinite programing ... RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining ... requires to solve a nonconvex optimization problem involving the parametric constraints as objective function ... cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems...

spatialEco
 Referenced in 1 article
[sw15496]
 utilities for climate and global deforestation spatial products, spatial smoothing, multivariate separability, point process model ... metrics, autologistic model, sampling models, cluster optimization and statistical exploratory tools...

PolyMat
 Referenced in 6 articles
[sw40601]
 element. Next, we couple a Discrete Material Optimization interpolation with the existing penalization and introduce ... such that we can employ continuation and smoothly transition from a convex problem without ... design variables, i.e., they can be defined globally or locally for any subset...

GlobiPack
 Referenced in 0 articles
[sw10743]
 globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives...

L1PMA
 Referenced in 2 articles
[sw21492]
 best L 1 piecewise monotonic data smoothing. Fortran 77 software is presented for the calculation ... dynamic programming algorithm separates the measurements into optimal disjoint sections of adjacent data and applies ... algorithm is that it terminates at a global minimum in at most...

IQCGame
 Referenced in 1 article
[sw39462]
 theory to study firstorder methods for smooth and stronglymonotone games and show ... provide for the first time a global convergence rate for the negative momentum method ... prove that the gradient method with optimal step size achieves the fastest provable worstcase...

ADOLC
 Referenced in 257 articles
[sw00019]
 ADOLC: Automatic Differentiation of C/C++. We present...

AIFS
 Referenced in 14 articles
[sw00023]
 A considerable class of fractal sets can be...

ANSYS
 Referenced in 713 articles
[sw00044]
 ANSYS offers a comprehensive software suite that spans...