Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
From MaRDI portal
(Redirected from Publication:6166099)
Recommendations
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- scientific article; zbMATH DE number 569957
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations for mixed-integer nonlinear programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A general branch-and-bound framework for continuous global multiobjective optimization
- A hybrid approach for biobjective optimization
- A reformulation framework for global optimization
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Bilevel programming for generating discrete representations in multiobjective optimization
- Bound sets for biobjective combinatorial optimization problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex relaxations for gas expansion planning
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Efficient computation of the search region in multi-objective optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Mixed integer optimization of water supply networks
- Mixed integer programming: analyzing 12 years of progress
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Mixed-integer nonlinear optimization
- Multicriteria Optimization
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- On the representation of the search region in multi-objective optimization
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Reduced-order multiobjective optimal control of semilinear parabolic problems
- Reformulation and convex relaxation techniques for global optimization
- ROM-based multiobjective optimization of elliptic PDEs via numerical continuation
- Scalarizing vector optimization problems
- Solving mixed integer nonlinear programs by outer approximation
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Solving multiobjective mixed integer convex optimization problems
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Using Piecewise Linear Functions for Solving MINLPs
Cited in
(4)- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- Quadratic convex reformulations for multiobjective binary quadratic programming
- Computing the set of optimal points for nonconvex multi-objective optimization problems
- Considering homeowner acceptance of retrofit measures within energy supply network optimization
This page was built for publication: Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166099)
