Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Combinatorial Optimization

Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation

Rupaj Kumar Nayak, Nirmalya Kumar Mohanty

Published Jan 2, 2020• 2 citations
Publisher
DOI
10.1007/s10878-019-00517-8

Related papers

An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions

Xuewen Mu, Wenlong Liu

Optimization Letters•Mar 18, 2015•1 citation

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

Ricardo M. Lima, Ignacio E. Grossmann

Computational Optimization and Applications•Jun 16, 2016•28 citations

A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs

Wei-An Chen, Zhen Zhu, Nan Kong

Optimization Letters•Mar 8, 2017•4 citations

Quadratic Optimization in 0–1 Variables

Alain Billionnet

This chapter introduces some theoretical and algorithmic aspects of quadratic optimization in bivalent variables, which is, in general, an NP-hard problem. It discusses the central problem of quadratic optimization in 0–1 variables without constraints. The chapter reviews some results in the constraint case. It also discusses a property of pseudo-Boolean functions that is relatively rare in optimization. The chapter examines a formulation of the problem of maximizing a quadratic pseudo-Boolean functions (qpBf) using a mixed integer linear program. It focuses on the optimization of a function of bivalent variables subject to some constraints. This optimization model is extremely general and the chapter limits to the problem of optimizing a quadratic pseudo-Boolean function with linear constraints. The chapter shows that the optimal value of the dual Lagrangian problem is equal to the optimal value of the continuous relaxation of the classical linearization of the initial problem.

Wiley eBooks•Jul 10, 2014•2 citations

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

Mathematical Programming•May 17, 2011•136 citations

A first augmented Lagrangian method for binary QCQP problems based on a class of continuous functions

Nirakar Sahoo, Rupaj Kumar Nayak

This paper addresses the solution of a non-convex 0-1 QCQP using two faster convergent augmented Lagrangian methods (ALM) based on a class of continuous functions and a parameter free convexification method. The binary constraints are converted into a class of continuous functions and the non-convex constraints are convexified by a parameter free method. The proposed algorithm is then tested on a set of QCQP problems available in the research of Zheng and co-workers. We also present the comparison results among relaxed versions of SDPs and some state-of-the-art ALMs and obtained an advantage over their counterparts.

International Journal of Operational Research•Jan 1, 2026•0 citations
This chapter introduces some theoretical and algorithmic aspects of quadratic optimization in bivalent variables, which is, in general, an NP-hard problem. It discusses the central problem of quadratic optimization in 0–1 variables without constraints. The chapter reviews some results in the constraint case. It also discusses a property of pseudo-Boolean functions that is relatively rare in optimization. The chapter examines a formulation of the problem of maximizing a quadratic pseudo-Boolean functions (qpBf) using a mixed integer linear program. It focuses on the optimization of a function of bivalent variables subject to some constraints. This optimization model is extremely general and the chapter limits to the problem of optimizing a quadratic pseudo-Boolean function with linear constraints. The chapter shows that the optimal value of the dual Lagrangian problem is equal to the optimal value of the continuous relaxation of the classical linearization of the initial problem.
This paper addresses the solution of a non-convex 0-1 QCQP using two faster convergent augmented Lagrangian methods (ALM) based on a class of continuous functions and a parameter free convexification method. The binary constraints are converted into a class of continuous functions and the non-convex constraints are convexified by a parameter free method. The proposed algorithm is then tested on a set of QCQP problems available in the research of Zheng and co-workers. We also present the comparison results among relaxed versions of SDPs and some state-of-the-art ALMs and obtained an advantage over their counterparts.