A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
From MaRDI portal
Publication:6586253
Cites work
- scientific article; zbMATH DE number 3446326 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- A divide-and-conquer local search heuristic for data visualization
- A polyhedral branch-and-cut approach to global optimization
- A rigorous global optimization algorithm for problems with ordinary differential equations
- A stochastic quasi-Newton method for large-scale optimization
- An evolutionary method for complex-process optimization
- Appointment scheduling and real-time sequencing strategies for patient unpunctuality
- Benchmarking global optimization and constraint satisfaction codes
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Deterministic global optimization. Theory, methods and applications
- Exploring or reducing noise? A global optimization algorithm in the presence of noise
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization with nonlinear ordinary differential equations
- Global optimization. Theory, algorithms, and applications
- Handbook of global optimization
- Learning patient-specific parameters for a diffuse interface glioblastoma model from neuroimaging data
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- McCormick-Based Relaxations of Algorithms
- Multivariate McCormick relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the limited memory BFGS method for large scale optimization
- Probabilistic machine learning. An introduction
- Process planning in a fuzzy environment
- Testing Unconstrained Optimization Software
- The Cutting-Plane Method for Solving Convex Programs
- The cluster problem in multivariate global optimization
- Three enhancements for optimization-based bound tightening
- Updating Quasi-Newton Matrices with Limited Storage
This page was built for publication: A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586253)
