Pages that link to "Item:Q322958"
From MaRDI portal
The following pages link to Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958):
Displaying 38 items.
- A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Optimization of black-box problems using Smolyak grids and polynomial approximations (Q1668801) (← links)
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods (Q1719642) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- Bunkering policies for a fuel bunker management problem for liner shipping networks (Q2029266) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- Quantile-based optimal portfolio selection (Q2051167) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Deterministic global optimization with Gaussian processes embedded (Q2062323) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization (Q2070360) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- A robust approach to warped Gaussian process-constrained optimization (Q2097663) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian (Q2182783) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
- Pseudo expected improvement criterion for parallel EGO algorithm (Q2399490) (← links)
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
- Black-Box Optimization: Methods and Applications (Q5153493) (← links)
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization (Q6074062) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation (Q6586253) (← links)
