相关论文: On quadratic optimization problems and canonical d…
The DPG method with optimal test functions for solving linear quadratic optimal control problems with control constraints is studied. We prove existence of a unique optimal solution of the nonlinear discrete problem and characterize it…
This paper mainly addresses the Monge mass transfer problem in the 1-D case. Through an ingenious approximation mechanism, one transforms the Monge problem into a sequence of minimization problems, which can be converted into a sequence of…
We propose an approach to solving constrained combinatorial optimization problems based on embedding the concept of Lagrangian duality into the framework of adiabatic quantum computation. Within the setting of circuit-model fault-tolerant…
We discuss the algorithmic problem of minimal coupling gauge fields of the Yang-Mills type to Quantum Gravity in the approach known as Causal Dynamical Triangulations (CDT) as a step towards studying, ultimately, systems of gravity coupled…
General nonconvex optimization problems are studied by using the canonical duality-triality theory. The triality theory is proved for sums of exponentials and quartic polynomials, which solved an open problem left in 2003. This theory can…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
In this paper we design a novel class of online distributed optimization algorithms leveraging control theoretical techniques. We start by focusing on quadratic costs, and assuming to know an internal model of their variation. In this…
This paper presents global optimal solutions to a nonconvex quadratic minimization problem over a sphere constraint. The problem is well-known as a trust region subproblem and has been studied extensively for decades. The main challenge is…
A problem of the erroneous duality gap caused by the presence of symmetries is solved in this paper utilizing point group theory. The optimization problems are first divided into two classes based on their predisposition to suffer from this…
The formalism of Causal Dynamical Triangulations (CDT) attempts to provide a non-perturbative regularization of quantum gravity, viewed as an ordinary quantum field theory. In two dimensions one can solve the lattice theory analytically and…
We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting…
This paper presents a canonical duality theory for solving nonconvex minimization problem of Rosenbrock function. Extensive numerical results show that this benchmark test problem can be solved precisely and efficiently to obtain global…
In the Celis-Dennis-Tapia (CDT) problem a quadratic function is minimized over a region defined by two strictly convex quadratic constraints. In this paper we re-derive a necessary and optimality condition for the exactness of the dual…
The four dimensional Causal Dynamical Triangulations (CDT) approach to quantum gravity is already more than ten years old theory with numerous unprecedented predictions such as non-trivial phase structure of gravitational field and…
The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally…
We study a canonical duality method to solve a mixed-integer nonconvex fourth-order polynomial minimization problem with fixed cost terms. This constrained nonconvex problem can be transformed into a continuous concave maximization dual…
We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic…
We introduce a quantum algorithm integrating counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to tackle combinatorial optimization problems. This approach offers versatility, allowing implementation as either a…
The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of…