We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 10,000 results
  1. Compact mixed-integer programming formulations in quadratic optimization

    We present a technique for producing valid dual bounds for nonconvex quadratic optimization problems. The approach leverages an elegant piecewise...

    Benjamin Beach, Robert Hildebrand, Joey Huchette in Journal of Global Optimization
    Article 13 June 2022
  2. Solving integer indefinite quadratic bilevel programs with multiple objectives at the upper level

    Bilevel programming is characterized by the existence of two optimization problems in which the constraint region of the upper level problem is...

    Fatima Fali, Yasmin Cherfaoui, Mustapha Moulaï in Journal of Applied Mathematics and Computing
    Article 12 February 2024
  3. Mixed-integer quadratic optimization for waste flow quantification

    The transition to a circular economy can be realized with higher waste recycling. With the knowledge of waste flows and the links between them, it is...

    R. Šomplák, V. Smejkalová, J. Kůdela in Optimization and Engineering
    Article 27 August 2022
  4. 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...

    Gabriele Eichfelder, Oliver Stein, Leo Warnow in Journal of Optimization Theory and Applications
    Article Open access 01 September 2023
  5. Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I

    We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic...

    Benjamin Beach, Robert Burlacu, ... Robert Hildebrand in Computational Optimization and Applications
    Article Open access 30 January 2024
  6. Information complexity of mixed-integer convex optimization

    We investigate the information complexity of mixed-integer convex optimization under different types of oracles. We establish new lower bounds for...

    Amitabh Basu, Hongyi Jiang, ... Marco Molinaro in Mathematical Programming
    Article 27 May 2024
  7. On the convex hull of convex quadratic optimization problems with indicators

    Linchuan Wei, Alper Atamtürk, ... Simge Küçükyavuz in Mathematical Programming
    Article Open access 07 June 2023
  8. SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs

    We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints. In particular, we present a new...

    Carlos J. Nohra, Arvind U. Raghunathan, Nikolaos V. Sahinidis in Mathematical Programming
    Article 06 July 2021
  9. The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimization

    In this paper we study the well-known Chvátal–Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs). We prove several results...

    Frank de Meijer, Renata Sotirov in Mathematical Programming
    Article Open access 13 March 2024
  10. A test instance generator for multiobjective mixed-integer optimization

    Application problems can often not be solved adequately by numerical algorithms as several difficulties might arise at the same time. When develo**...

    Gabriele Eichfelder, Tobias Gerlach, Leo Warnow in Mathematical Methods of Operations Research
    Article Open access 19 July 2023
  11. Regularization of the Vector Problem with Quadratic Criteria of Pareto Optimization

    The article is devoted to the new results related to the regularization of vector (multicriteria) optimization problems on a feasible set of...

    T. T. Lebedeva, N. V. Semenova, T. I. Sergienko in Cybernetics and Systems Analysis
    Article 26 July 2023
  12. A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables

    Real-world problems are often nonconvex and involve integer variables, representing vexing challenges to be tackled using state-of-the-art solvers....

    Pitchaya Wiratchotisatian, Andrew C. Trapp in Optimization Letters
    Article 02 March 2023
  13. A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems

    In multi-objective mixed-integer convex optimization, multiple convex objective functions need to be optimized simultaneously while some of the...

    Gabriele Eichfelder, Leo Warnow in Mathematical Methods of Operations Research
    Article Open access 02 August 2023
  14. Exact SDP Reformulations for Adjustable Robust Quadratic Optimization with Affine Decision Rules

    In this paper, we deal with exact semidefinite programming (SDP) reformulations for a class of adjustable robust quadratic optimization problems with...

    Huan Zhang, **angkai Sun, Kok Lay Teo in Journal of Optimization Theory and Applications
    Article 02 February 2024
  15. Global optimization of mixed-integer nonlinear programs with SCIP 8

    For over 10 years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex...

    Ksenia Bestuzheva, Antonia Chmiela, ... Fabian Wegscheider in Journal of Global Optimization
    Article Open access 14 December 2023
  16. A graph-based decomposition method for convex quadratic optimization with indicators

    In this paper, we consider convex quadratic optimization problems with indicator variables when the matrix Q defining the quadratic term in the...

    Pei**g Liu, Salar Fattahi, ... Simge Küçükyavuz in Mathematical Programming
    Article 21 June 2022
  17. Supermodularity and valid inequalities for quadratic optimization with indicators

    We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous...

    Alper Atamtürk, Andrés Gómez in Mathematical Programming
    Article Open access 22 December 2022
  18. Learning to optimize: A tutorial for continuous and mixed-integer optimization

    Learning to optimize (L2O) stands at the intersection of traditional optimization and machine learning, utilizing the capabilities of machine...

    **aohan Chen, Jialin Liu, Wotao Yin in Science China Mathematics
    Article 08 May 2024
Did you find what you were looking for? Share feedback.