Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 40 for “"Polynomial optimization"”.
-
Polynomial Optimization and the Moment Problem
… We are interested in the moment problem with polynomial data and its relation to real algebra and real algebraic geometry. In this direction, we consider two different variants of moment problem. The first variant is the global polynomial optimization problem, i.e., finding the minimum of a …
-
Polynomial optimization: structures, algorithms, and engineering applications
As a fundamental model in Operations Research, polynomial optimization has been receiving increasingly more attention in the recent years, due to its versatile modern applications in engineering such as biomedical engineering, signal processing, material science, speech recognition, and so on. In …
-
The numerical algebraic geometry approach to polynomial optimization
… to approximate the solution sets of systems of polynomial equations arising from applications in science and engineering. This research focused on finding global solutions to constrained polynomial optimization problems of moderate size using NAG methods. The benefit of employing a NAG approach …
-
Solving Polynomial Optimization Problem and Noncooperative Games by a Homotopy Algorithm
… of finding all the solutions of a system of m polynomials in m variables is studied in this paper. Unlike earlier studies (6, 8, 18), optimization and game problems are the focus. This paper checks solutions, compares function evaluations whenever possible, and presents absolute error as well …
-
Model-based and data-based frequency domain design of fixed structure robust controller: a polynomial optimization approach
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Program for manipulating and solving nonlinear generalized polynomial optimization problems with geometric programming and symbolic constraint reduction, A
Includes bibliographical references (pages 49-51).
-
The Bounded-SOS+SONC Relaxation: Theory, Convergence Analysis, and Implementation
Polynomial optimization is a class of global optimization problems defined by real polynomials, with applications in power systems, portfolio optimization and control theory. At the heart of polynomial optimization lies the problem of certifying the global nonnegativity of polynomials. Algebraic …
-
Non-negative Polynomials, Sums of Squares & The Moment Problem
This thesis studies polynomial optimization, that is, the problem of minimizing the value of a polynomial over a semi-algebraic set. Such polynomial optimization problems arise in a wide variety of contexts, both in mathematics, and more generally in science and engineering. In the first part of …
-
Invariant conic optimization with basis-dependent cones: Scaled diagonally dominant matrices and real *-algebra decomposition
… For other cones that are basis-dependent, if optimization problems over those cones have symmetries one can still change to a symmetry-adapted basis that block diagonalizes the matrix. However, this change of basis generally changes the constraint cone and can change the optimum. In this …
-
Convex Geometry in Projection Methods and the Cone of Sums of Nonnegative Circuit Polynomials
… Euclidean spaces. Convex sets arise naturally in optimization, convex analysis, and PDEs. In this thesis, we study projection methods and the cone of sums of nonnegative circuit (SONC) polynomials. Projection methods form an efficient class of algorithms for solving feasibility problems in convex …
-
Algebraic characterization of non-negativity of polynomials over polytopes
… we provide an algebraic method of recognizing polynomial ideals with structures that are conducive to the study of sum of squares (SOS) polynomials. Such ideals correspond to regions in space over which certificates of non-negativity may be efficiently obtained. As such, these regions are of …
-
A Branch and Bound Method for Sum of Completion Permutation Flow Shop
… machine permutation flow shop problem where the optimization criterion is the minimization of sum of completion times of all the jobs. The permutation flow shop problem (F||∑Ci ) belongs to the class of NP-hard problems; finding the optimal solution is thus expected to be highly computational. …
-
Control Theoretic Methods In Analysis And Design Of Optimization Algorithms
… control theory to analyze and design iterative optimization algorithms. This new perspective provides many insights and new directions of research. In particular, we can study robustness to uncertainties, provide nonconservative performance guarantees, and envision principled algorithm design. …
-
Time delay margin analysis for adaptive flight control laws.
… It is noted that the controller is governed by polynomial dynamics. Polynomial optimization tools are then applied to the closed-loop model to assess its robustness to time delays. Time delay margins are computed for various tuning of design parameters in the adaptive law, as well as in the …
-
Algorithms and Software for Structured Semidefinite Optimization
… numerical experiments using the truss topology optimization problems of growing dimension which is formulated as large-scale SDP with the low-rank solution and the sensor network localization problems. The numerical re-sults demonstrate that our preconditioner is working better than …
-
LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS
… programming relaxations arising from nonconvex optimization. For doubly nonnegative relaxations of mixed-binary quadratic programs, it introduces RiNNAL, a globally convergent augmented Lagrangian method that exploits low-rank structure and reformulates factorized quadratic constraints as …
-
A convex relaxation approach to set-membership identification
… parameter set can be formulated in terms of polynomial optimization problems, where the number of decision variables increases with the length of the experimental data sequence. Such problems are generally nonconvex and NP-hard. Therefore, standard nonlinear optimization tools can not be used …
Page 1 of 2