Pages that link to "Item:Q1856388"
From MaRDI portal
The following pages link to Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388):
Displayed 50 items.
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Linear programming models for a stochastic dynamic capacitated lot sizing problem (Q337545) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Optimal rank-sparsity decomposition (Q486401) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Packing ellipsoids into volume-minimizing rectangular boxes (Q506451) (← links)
- A polynomially solvable case of the pooling problem (Q513170) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- Nonlinear dynamic systems design based on the optimization of the domain of attraction (Q552070) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- Three modeling paradigms in mathematical programming (Q607499) (← links)
- Estimation of domains of attraction: A global optimization approach (Q611806) (← links)
- Study of multiscale global optimization based on parameter space partition (Q620530) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- Modern tools for the time-discrete dynamics and optimization of gene-environment networks (Q654347) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Generalized McCormick relaxations (Q656963) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities (Q684137) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- New methods for calculating \(\alpha\)BB-type underestimators (Q742131) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
