scientific article; zbMATH DE number 5064898

From MaRDI portal

Revision as of 03:05, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5494170

Jump to:navigation, search

zbMath1115.90044MaRDI QIDQ5494170

Gleb Beliakov

Publication date: 17 October 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global optimization uniform approximation cutting angle method abstract convexity random variate generation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (4)

A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Solving DC programs using the cutting angle method ⋮ Bounded lower subdifferentiability optimization techniques: applications ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5494170&oldid=30050199"