Results 21 to 30 of about 336,796 (327)
A mixed integer optimization approach for model selection in screening experiments
After completing the experimental runs of a screening design, the responses under study are analyzed by statistical methods to detect the active effects.
Alan R. Vazquez, E. Schoen, P. Goos
semanticscholar +1 more source
A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
This paper proposes a general framework for solving multiobjective nonconvex optimization problems, i.e., optimization problems in which multiple objective functions have to be optimized simultaneously.
Gabriele Eichfelder +2 more
semanticscholar +1 more source
Mixed-integer convex representability [PDF]
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems.
Lubin, Miles +2 more
core +2 more sources
GloMIQO: Global mixed-integer quadratic optimizer
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Misener, R, Floudas, CA
openaire +3 more sources
A Framework for Globally Optimizing Mixed-Integer Signomial Programs [PDF]
Mixed-integer signomial optimization problems have broad applicability in engineering. Extending the Global Mixed-Integer Quadratic Optimizer, GloMIQO (Misener, Floudas in J. Glob. Optim., 2012. doi:10.1007/s10898-012-9874-7), this manuscript documents a
Floudas, CA, Misener, R
core +1 more source
Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps [PDF]
Feasibility pumps are highly effective primal heuristics for mixed-integer linear and nonlinear optimization. However, despite their success in practice there are only a few works considering their theoretical properties.
Björn Geißler +3 more
semanticscholar +1 more source
Mirror-Descent Methods in Mixed-Integer Convex Optimization [PDF]
In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard.
A. Conn +15 more
core +3 more sources
Solving Multiobjective Mixed Integer Convex Optimization Problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De Santis, Marianna +3 more
openaire +2 more sources
On the Complexity of Inverse Mixed Integer Linear Optimization [PDF]
Inverse optimization is the problem of determining the values of missing input parameters for an associated forward problem that are closest to given estimates and that will make a given target vector optimal.
A. Bulut, T. Ralphs
semanticscholar +1 more source
A Modified Jaya Algorithm for Mixed-Variable Optimization Problems
Mixed-variable optimization problems consist of the continuous, integer, and discrete variables generally used in various engineering optimization problems.
Singh Prem, Chaudhary Himanshu
doaj +1 more source

