Results 31 to 40 of about 322,300 (286)
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives [PDF]
QuantumMany practically important NP-hard optimization problems are inherently higher-order polynomial optimizations, which are typically addressed using approximation algorithms.
Iria W. Wang +5 more
doaj +1 more source
On the energy landscape of symmetric quantum signal processing [PDF]
Quantum, 2022 Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given polynomial $f$
Jiasu Wang, Yulong Dong, Lin Lin
doaj +1 more source
Stability and Performance Verification of Optimization-based Controllers [PDF]
, 2015 This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed technique include
Jones, Colin N., Korda, Milan
core +2 more sources
Penerapan Algoritma Optimasi Chaos pada Jaringan Ridge Polynomial untuk Prediksi Jumlah Pengangguran
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2013 Abstrak Ridge polynomial neural network (RPNN) awalnya diusulkan oleh Shin dan Ghosh, dibangun dari jumlah peningkatan order pi-sigma neuron (PSN). RPNN mempertahankan pembelajaran cepat, pemetaan yang kuat dari layer tunggal higher order neural network
Rina Pramitasari, Retantyo Wardoyo
doaj +1 more source
Yield-Constrained Optimization Design Using Polynomial Chaos for Microwave Filters
IEEE Access, 2021 Yield optimization aims at finding microwave filter designs with high yield under fabrication tolerance. The electromagnetic (EM) simulation-based yield optimization methods are computationally expensive because a large number of EM simulations is ...
Zhen Zhang +4 more
doaj +1 more source
Convex Combinatorial Optimization [PDF]
, 2003 We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several
Onn, Shmuel, Rothblum, Uriel G.
core +4 more sources
Optimization via Chebyshev polynomials [PDF]
Journal of Applied Mathematics and Computing, 2017 This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS ...
openaire +3 more sources
, 2023 Inspired by Leonhard Euler’s belief that every event in the world can be understood in terms of maximizing or minimizing a specific quantity, this thesis delves into the realm of mathematical optimization. The thesis is divided into four parts, with optimization acting as the unifying thread.
openaire +3 more sources
Shipin yu jixie, 2023 Objective: Solved the problems of poor motion stability and accuracy in the food sorting process of parallel robots. Methods: Based on the analysis of the three degree of freedom food sorting robot system, a method proposed which combined polynomial ...
FU Mingdi +3 more
doaj +1 more source
, 2002 Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations.
C. H. Bennett +14 more
core +2 more sources