Results 21 to 30 of about 322,300 (286)
Symmetries in Polynomial Optimization
This chapter investigates how symmetries can be used to reduce the computational complexity in polynomial optimization problems. A focus will be specifically given on the Moment-SOS hierarchy in polynomial optimization, where results from representation theory and invariant theory of groups can be used.
Moustrou, Philippe +2 more
openaire +6 more sources
Minimizing Rational Functions by Exact Jacobian SDP Relaxation Applicable to Finite Singularities [PDF]
This paper considers the optimization problem of minimizing a rational function. We reformulate this problem as polynomial optimization by the technique of homogenization. These two problems are shown to be equivalent under some generic conditions.
Guo, Feng, Wang, Li, Zhou, Guangming
core +1 more source
Algebraic Solution of Tropical Polynomial Optimization Problems
We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication).
Nikolai Krivulin
doaj +1 more source
Development of a mathematical model of the heating nuclear power unit for optimization studies of autonomous electric power systems [PDF]
A two-stage method for creating mathematical models of thermal power nuclear power units for studying autonomous electric power systems is presented in the article. A detailed model of a nuclear power unit is being developed as the first stage. The model
Stepanova Elena L., Zharkov Pavel V.
doaj +1 more source
Tangencies and polynomial optimization
a minor change in the ...
openaire +2 more sources
Optimal Polynomial Recurrence [PDF]
AbstractLet P ∊ ℤ[n] with P(0) = 0 and “ > 0. We show, using Fourier analytic techniques, that if then there must exist n ∊ ℕ such thatIn addition to this we show, using the same Fourier analytic methods, that if A ⊆ ℕ, then the set of ε-optimal return timesis syndetic for every ε > 0.
Lyall, Neil, Magyar, Akos
openaire +2 more sources
From combinatorial optimization to real algebraic geometry and back
In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem.
Janez Povh
doaj +1 more source
Cutting-Edge Trajectory Optimization through Quantum Annealing
This paper introduces an innovative approach to explore the capabilities of Quantum Annealing (QA) for trajectory optimization in dynamic systems.
Andrea Carbone +2 more
doaj +1 more source
A Semidefinite Programming Approach for Harmonic Balance Method
The harmonic balance method is broadly employed for analyzing and predicting the periodic steady-state solution. Most of the traditional methods in the literature do not guarantee global optimality. Due to its nonconvexity, it is a complex task to find a
Cheng H. Yang, Ben S. Deng
doaj +1 more source
Border Basis relaxation for polynomial optimization [PDF]
A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set.
Bucero, Marta Abril, Mourrain, Bernard
core +8 more sources

