Pages that link to "Item:Q2249819"

The following pages link to Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819):

Displaying 21 items.

• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
• Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
• On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
• An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← links)
• A simplicial homology algorithm for Lipschitz optimisation (Q1756767) (← links)
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
• SMGO: a set membership approach to data-driven global optimization (Q2065241) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
• Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization (Q2399492) (← links)
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
• On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
• On the Least-Squares Fitting of Data by Sinusoids (Q2958622) (← links)
• Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
• A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)
• An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)