scientific article
From MaRDI portal
Publication:2864120
zbMath1286.90003MaRDI QIDQ2864120
Publication date: 5 December 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm, Global optimization issues in deep network regression: an overview, Improved penalty algorithm for mixed integer PDE constrained optimization problems, Basin hopping networks of continuous global optimization problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computational investigation of simple memetic approaches for continuous global optimization, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, Generalized parallel computational schemes for time-consuming global optimization, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Escaping local minima with local derivative-free methods: a numerical investigation, Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations, Optimising portfolio diversification and dimensionality, On maximum ratio clique relaxations, Double descent and intermittent color diffusion for landscape exploration, 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, (Global) optimization: historical notes and recent developments, Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods, Global optimization method with numerically calculated function derivatives, Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise, Subdomain separability in global optimization, A memetic procedure for global multi-objective optimization, A consensus-based model for global optimization and its mean-field limit, New bounds for nonconvex quadratically constrained quadratic programming, Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation, Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme, Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems, Deterministic global optimization of steam cycles using the IAPWS-IF97 model, Global optimization for data assimilation in landslide tsunami models, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Deterministic global optimization with artificial neural networks embedded, Computationally efficient approach for solving lexicographic multicriteria optimization problems, Maximization of a PSD quadratic form and factorization, A filling function method for unconstrained global optimization, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Efficient multicriterial optimization based on intensive reuse of search information, Parallel two-phase methods for global optimization on GPU, Incremental method for multiple line detection problem -- iterative reweighted approach, Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs, Tighter McCormick relaxations through subgradient propagation, A new algorithm for concave quadratic programming, A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision, Efficient large scale global optimization through clustering-based population methods, Clustering methods for large scale geometrical global optimization, Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Global optimization based on local searches, Global optimization based on local searches, Deterministic global optimization with Gaussian processes embedded, Computationally efficient identification of continuous-time Lur'e-type systems with stability guarantees, Hopping between distant basins, Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation, Extended formulations for convex hulls of some bilinear functions, An algorithm for computing Fréchet means on the sphere, Preisach based storage devices and global optimizers, On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints, Multidimensional global optimization using numerical estimates of objective function derivatives, An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Uses Software
