Symbolic optimization of algebraic functions

Authors:
Masaaki Kanno;Kazuhiro Yokoyama;Hirokazu Anai;Shinji Hara
Affiliations:
Japan Science and Technology Agency, Kawaguchi-shi, Saitama, Japan;Rikkyo University, Toshima-ku, Tokyo, Japan;Fujitsu Laboratories Ltd, Nakahara-ku, Kawasaki, Japan;The University of Tokyo, Bunkyo-ku, Tokyo, Japan
Venue:
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Year:
2008

Citing 19
Cited 0

Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
Solutions of systems of algebraic equations and linear maps on residue class rings

Journal of Symbolic Computation
Discrete-time control systems (2nd ed.)

Discrete-time control systems (2nd ed.)
Constructive algebra methods for the L2-problem for stable linear systems

Automatica (Journal of IFAC)
Robust multi-objective feedback design by quantifier elimination

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Simulation and optimization by quantifier elimination

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
A modular method to compute the rational univariate representation of zero-dimensional ideals

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
A new algorithm for discussing Gröbner bases with parameters

Journal of Symbolic Computation
Computer Algebra in Industry: Problem Solving in Practice: Proceedings of the 1991 Scafi Seminar at Cwi, Amsterdam

Computer Algebra in Industry: Problem Solving in Practice: Proceedings of the 1991 Scafi Seminar at Cwi, Amsterdam
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
QEPCAD B: a program for computing with semi-algebraic sets using CADs

ACM SIGSAM Bulletin
Efficient projection orders for CAD

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Solving parametric polynomial systems

Journal of Symbolic Computation
Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Positive Trigonometric Polynomials and Signal Processing Applications

Positive Trigonometric Polynomials and Signal Processing Applications
Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem

Journal of Symbolic Computation
On the relationship between the sum of roots with positive real parts and polynomial spectral factorization

NMA'06 Proceedings of the 6th international conference on Numerical methods and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper attempts to establish a new framework of symbolic optimization of algebraic functions that is relevant to possibly a wide variety of practical application areas. The crucial aspects of the framework are (i) the suitable use of algebraic methods coupled with the discovery and exploitation of structural properties of the problem in the conversion process into the framework, and (ii) the feasibility of algebraic methods when performing the optimization. As an example an algebraic approach is developed for the discrete-time polynomial spectral factorization problem that illustrates the significance and relevance of the proposed framework. A numerical example of a particular control problem is also included to demonstrate the development.