Immanuel M. Bomze

Comput. Optim. Appl., June, 2025

On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., March, 2025

Uncertain standard quadratic optimization under distributional assumptions: A chance-constrained epigraphic approach.

[BibT_eX]

[DOI]

Daniel de Vicente

Oper. Res. Lett., 2025

In memoriam: Marguerite Straus Frank (1927-2024).

[BibT_eX]

[DOI]

Anna Nagurney

EURO J. Comput. Optim., 2025

2024

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2024

The Marguerite Frank Award for the best EJCO paper 2023.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2024

Feature selection in linear SVMs via hard cardinality constraint: a scalable SDP decomposition approach.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Optimization under uncertainty and risk: Quadratic and copositive approaches.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., October, 2023

Conic formulation of QPCCs applied to truly sparse QPs.

[BibT_eX]

[DOI]

Bo Peng

Comput. Optim. Appl., April, 2023

The Marguerite Frank Award for the best EJCO paper 2022.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., January, 2023

Uncover: Toward Interpretable Models for Detecting New Star Cluster Members.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2023

2022

Fast Cluster Detection in Networks by First Order Optimization.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2022

Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty.

[BibT_eX]

[DOI]

SIAM J. Optim., 2022

Two-stage stochastic standard quadratic optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

The Marguerite Frank Award for the best EJCO paper 2021.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2022

Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

2021

Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization.

[BibT_eX]

[DOI]

Michael Kahr

Markus Leitner

Math. Oper. Res., 2021

Interplay of non-convex quadratically constrained problems with adjustable robust optimization.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2021

Frank-Wolfe and friends: a journey into projection-free first-order optimization methods.

[BibT_eX]

[DOI]

4OR, 2021

2020

Active Set Complexity of the Away-Step Frank-Wolfe Algorithm.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

Constructing Patterns of (Many) ESSs Under Support Size Control.

[BibT_eX]

[DOI]

Dyn. Games Appl., 2020

2019

First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank-Wolfe Variants.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Hessian Barrier Algorithms for Linearly Constrained Optimization Problems.

[BibT_eX]

[DOI]

Panayotis Mertikopoulos

Mathias Staudigl

SIAM J. Optim., 2019

Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations.

[BibT_eX]

[DOI]

Paula Alexandra Amaral

J. Glob. Optim., 2019

Pure infection-immunization dynamics for partnership games: A correction.

[BibT_eX]

[DOI]

Games Econ. Behav., 2019

Egon Balas (1922-2019).

[BibT_eX]

[DOI]

Paolo Toth

Eur. J. Oper. Res., 2019

Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches.

[BibT_eX]

[DOI]

Jianqiang Cheng

Peter J. C. Dickinson

Abdel Lisser

Jia Liu

Comput. Manag. Sci., 2019

2018

The Complexity of Simple Models - A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem.

[BibT_eX]

[DOI]

Reinhard Ullrich

Math. Oper. Res., 2018

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations.

[BibT_eX]

[DOI]

Vaithilingam Jeyakumar

Guoyin Li

J. Glob. Optim., 2018

Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr.

[BibT_eX]

[DOI]

Ulrike Leopold-Wildburger

Karl F. Doerner

Richard F. Hartl

Central Eur. J. Oper. Res., 2018

Building a completely positive factorization.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2018

2017

A fresh CP look at mixed-binary QPs: new formulations and relaxations.

[BibT_eX]

[DOI]

Jianqiang Cheng

Peter J. C. Dickinson

Abdel Lisser

Math. Program., 2017

Forty years of the European Journal of Operational Research: A bibliometric overview.

[BibT_eX]

[DOI]

José Fernando Oliveira

Ruud H. Teunter

Eur. J. Oper. Res., 2017

2015

New Lower Bounds and Asymptotics for the cp-Rank.

[BibT_eX]

[DOI]

Reinhard Ullrich

SIAM J. Matrix Anal. Appl., 2015

Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

Narrowing the difficulty gap for the Celis-Dennis-Tapia problem.

[BibT_eX]

[DOI]

Michael L. Overton

Math. Program., 2015

2014

Copositivity and constrained fractional quadratic problems.

[BibT_eX]

[DOI]

Paula Amaral

Joaquim Júdice

Math. Program., 2014

Rounding on the standard simplex: regular grids for global optimization.

[BibT_eX]

[DOI]

Stefan Gollowitzer

E. Alper Yildirim

J. Glob. Optim., 2014

2013

On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix.

[BibT_eX]

[DOI]

Naomi Shaked-Monderer

Florian Jarre

SIAM J. Matrix Anal. Appl., 2013

Copositivity detection by difference-of-convex decomposition and ω-subdivision.

[BibT_eX]

[DOI]

Gabriele Eichfelder

Math. Program., 2013

Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem.

[BibT_eX]

[DOI]

Alexander Engau

Miguel F. Anjos

Math. Methods Oper. Res., 2013

2012

Separable standard quadratic optimization problems.

[BibT_eX]

[DOI]

Optim. Lett., 2012

Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization.

[BibT_eX]

[DOI]

Gabriele Uchida

J. Glob. Optim., 2012

Standard bi-quadratic optimization problems and unconstrained polynomial reformulations.

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

Copositive optimization - Recent developments and applications.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

2011

Quadratic factorization heuristics for copositive programming.

[BibT_eX]

[DOI]

Florian Jarre

Franz Rendl

Math. Program. Comput., 2011

A first-order interior-point method for linearly constrained smooth optimization.

[BibT_eX]

[DOI]

Paul Tseng

Math. Program., 2011

Infection and immunization: A new class of evolutionary game dynamics.

[BibT_eX]

[DOI]

Games Econ. Behav., 2011

Graph-based quadratic optimization: A fast evolutionary approach.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2011

2010

A note on Burer's copositive representation of mixed-binary QPs.

[BibT_eX]

[DOI]

Florian Jarre

Optim. Lett., 2010

Copositivity cuts for improving SDP bounds on the clique number.

[BibT_eX]

[DOI]

Florian Frommlet

Math. Program., 2010

Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Standard Quadratic Optimization Problems: Theory.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Standard Quadratic Optimization Problems: Applications.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Standard Quadratic Optimization Problems: Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Copositive Optimization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Conic Duality Frank-Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

2008

New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.

[BibT_eX]

[DOI]

Fabio Tardella

Math. Program., 2008

A New Approach to Exact Crossing Minimization.

[BibT_eX]

[DOI]

Markus Chimani

Petra Mutzel

Proceedings of the Algorithms, 2008

2007

Improved SDP bounds for minimizing quadratic functions over the <i>l</i><sup>1</sup>\ell^{1}-ball.

[BibT_eX]

[DOI]

Florian Frommlet

Martin Rubey

Optim. Lett., 2007

New results for molecular formation under pairwise potential minimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2007

2005

Quartic Formulation of Standard Quadratic Optimization Problems.

[BibT_eX]

[DOI]

Laura Palagi

J. Glob. Optim., 2005

Optimization of functions with rank-two variation over a box.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

2004

The combinatorics of pivoting for the maximum weight clique.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Ellipsoidal Approach to Box-Constrained Quadratic Problems.

[BibT_eX]

[DOI]

Pasquale L. De Angelis

Gerardo Toraldo

J. Glob. Optim., 2004

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2004

Hyper sensitivity Analysis of portfolio Optimization Problems.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2004

2002

Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects.

[BibT_eX]

[DOI]

SIAM Rev., 2002

A Complementary Pivoting Approach to the Maximum Weight Clique Problem.

[BibT_eX]

[DOI]

Alessio Massaro

SIAM J. Optim., 2002

Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming.

[BibT_eX]

[DOI]

Etienne de Klerk

J. Glob. Optim., 2002

Branch-and-bound approaches to standard quadratic optimization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2002

Annealed replication: a new heuristic for the maximum clique problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2000

Approximating the maximum weight clique using replicator dynamics.

[BibT_eX]

[DOI]

Volker Stix

IEEE Trans. Neural Networks Learn. Syst., 2000

Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2000

On Copositive Programming and Standard Quadratic Optimization Problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2000

1999

Genetic engineering via negative fitness: Evolutionary dynamics for global optimization.

[BibT_eX]

[DOI]

Volker Stix

Ann. Oper. Res., 1999

The Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

On Standard Quadratic Optimization Problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 1998

1997

Evolution towards the Maximum Clique.

[BibT_eX]

[DOI]

J. Glob. Optim., 1997

Global Escape Strategies for Maximizing Quadratic Forms over a Simplex.

[BibT_eX]

[DOI]

J. Glob. Optim., 1997

1996

Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 1996

1995

Lotka-Volterra equation and replicator dynamics: new issues in classification.

[BibT_eX]

[DOI]

Biol. Cybern., 1995

1994

A finite algorithm for solving general quadratic problems.

[BibT_eX]

[DOI]

Gabriele Danninger

J. Glob. Optim., 1994

1993

A Global Optimization Algorithm for Concave Quadratic Programming Problems.

[BibT_eX]

[DOI]

Gabriele Danninger

SIAM J. Optim., 1993

Using copositivity for global optimality criteria in concave quadratic programming problems.

[BibT_eX]

[DOI]

Gabriele Danninger

Math. Program., 1993

Optimierung, Theorie und Algorithmen - eine Einführung in Operations Research für Wirtschaftsinformatiker.

[BibT_eX]

Wilfried Grossmann

BI-Wissenschaftsverlag, ISBN: 978-3-411-15091-5, 1993

1992

A dynamical characterization of evolutionarily stable states.

[BibT_eX]

[DOI]