A branch-and-bound algorithm with growing datasets for large-scale parameter estimation

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A Stochastic Quasi-Newton Method for Large-Scale Optimization
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
Exploring or reducing noise? A global optimization algorithm in the presence of noise
Three enhancements for optimization-based bound tightening
An evolutionary method for complex-process optimization
On the limited memory BFGS method for large scale optimization
Process planning in a fuzzy environment
The cluster problem in multivariate global optimization
Handbook of global optimization
Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
A polyhedral branch-and-cut approach to global optimization
Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
A rigorous global optimization algorithm for problems with ordinary differential equations
Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
Deterministic global optimization. Theory, methods and applications
A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
Linearization of McCormick relaxations and hybridization with the auxiliary variable method
Appointment scheduling and real-time sequencing strategies for patient unpunctuality
Multivariate McCormick relaxations
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Global optimization with nonlinear ordinary differential equations
A divide-and-conquer local search heuristic for data visualization
MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
The Cutting-Plane Method for Solving Convex Programs
Branching and bounds tighteningtechniques for non-convex MINLP
McCormick-Based Relaxations of Algorithms
Testing Unconstrained Optimization Software
Updating Quasi-Newton Matrices with Limited Storage
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Learning patient‐specific parameters for a diffuse interface glioblastoma model from neuroimaging data
Global Optimization and Constraint Satisfaction

This page was built for publication: A branch-and-bound algorithm with growing datasets for large-scale parameter estimation