Unconstrained formulation of standard quadratic optimization problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immanuel M. Bomze +2 more
core +9 more sources
An Improved Adaptive Trust-Region Method for Unconstrained Optimization [PDF]
In this study, we propose a trust-region-based procedure to solve unconstrained optimization problems that take advantage of the nonmonotone technique to introduce an efficient adaptive radius strategy.
Hamid Esmaeili, Morteza Kimiaei
doaj +3 more sources
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization [PDF]
Landscapes’ theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of an especial kind of landscape called elementary landscape. The elementary landscape decomposition of a combinatorial optimization problem is a useful tool for understanding the problem.
Francisco Chicano, Enrique Alba 0001
openaire +5 more sources
A New Augmented Lagrangian Method for Equality Constrained Optimization with Simple Unconstrained Subproblem [PDF]
We propose a new method for equality constrained optimization based on augmented Lagrangian method. We construct an unconstrained subproblem by adding an adaptive quadratic term to the quadratic model of augmented Lagrangian function.
Hao Zhang, Qin Ni
doaj +2 more sources
QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization [PDF]
We present QUBO.jl, an end-to-end Julia package for working with QUBO (Quadratic Unconstrained Binary Optimization) instances. This tool aims to convert a broad range of JuMP problems for straightforward application in many physics and physics-inspired solution methods whose standard optimization form is equivalent to the QUBO.
Xavier, Pedro Maciel +5 more
openaire +3 more sources
An encoding of argumentation problems using quadratic unconstrained binary optimization [PDF]
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic function over binary variables (0/1), where the coefficients can be represented by a symmetric square matrix (or an ...
Baioletti M., Santini F.
openaire +3 more sources
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems [PDF]
Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +2 more sources
Preconditioned conjugate gradient methods for absolute value equations
We investigate the NP-hard absolute value equations (AVE), \(Ax-B|x| =b\), where \(A,B\) are given symmetric matrices in \(\mathbb{R}^{n\times n}, \ b\in \mathbb{R}^{n}\).
Nassima Anane, Mohamed Achache
doaj +7 more sources
Smooth Twin Parametric Insensitive Support Vector Regression [PDF]
As one of the machine learning methods, twin parametric insensitive support vector regression (TPISVR) had a simple mathematical model and good learning performance.
HUANG Huajuan, WEI Xiuxi, ZHOU Yongquan
doaj +1 more source
Diversifying Investments and Maximizing Sharpe Ratio: A Novel Quadratic Unconstrained Binary Optimization Formulation [PDF]
The optimization of investment portfolios represents a pivotal task within the field of financial economics. Its objective is to identify asset combinations that meet specified criteria for return and risk.
Mirko Mattesi +6 more
doaj +2 more sources

