RKReza Kamyar

Reza Kamyar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Reza Kamyar has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimal Thermostat Programming and Optimal Electricity Rates for Customers with Demand Charges

    by Reza Kamyar, Matthew M. Peet

    We consider the coupled problems of optimal thermostat programming and optimal pricing of electricity. Our framework consists of a single user and a single provider (a regulated utility). The provider sets prices for the user, who pays for both total energy consumed (\$/kWh, including peak and off-peak rates) and the peak rate of consumption in a month (a demand charge) (\$/kW). The cost of electricity for the provider is based on a combination of capacity costs (\$/kW) and fuel costs (\$/kWh). In the optimal thermostat programming problem, the user minimizes the amount paid for electricity while staying within a pre-defined temperature range. The user has access to energy storage in the form of thermal capacitance of the interior structure of the building. The provider sets prices designed to minimize the total cost of producing electricity while meeting the needs of the user. To solve the user-problem, we use a variant of dynamic programming. To solve the provider-problem, we use a descent algorithm coupled with our dynamic programming code - yielding optimal on-peak, off-peak and demand prices. We show that thermal storage and optimal thermostat programming can reduce electricity bills using current utility prices from utilities Arizona Public Service (APS) and Salt River Project (SRP). Moreover, we obtain optimal utility prices which lead to significant reductions in the cost of generating electricity and electricity bills.

  • Open Access

    Polynomial Optimization with Applications to Stability Analysis and Control - Alternatives to Sum of Squares

    by Reza Kamyar, Matthew Peet

    In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation Linear Techniques, Blossoming and Groebner basis methods, our main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and Handelman's theorem. We first formulate polynomial optimization problems as verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's algorithm, Bernstein's algorithm and Handelman's algorithm reduce the intractable problem of feasibility of semi-algebraic sets to linear and/or semi-definite programming. We apply these algorithms to different problems in robust stability analysis and stability of nonlinear dynamical systems. As one contribution of this paper, we apply Polya's algorithm to the problem of H_infinity control of systems with parametric uncertainty. Numerical examples are provided to compare the accuracy of these algorithms with other polynomial optimization algorithms in the literature.

  • Open Access

    Polynomial optimization with applications to stability analysis and control - Alternatives to sum of squares

    by Reza Kamyar, Matthew M. Peet

    In this paper, we explore the merits of various algorithms for solving polynomial optimization and optimization of polynomials, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation Linear Techniques, Blossoming and Groebner basis methods, our main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and Handelman's theorem. We first formulate polynomial optimization problems as verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's algorithm, Bernstein's algorithm and Handelman's algorithm reduce the intractable problem of feasibility of semi-algebraic sets to linear and/or semi-definite programming. We apply these algorithms to different problems in robust stability analysis and stability of nonlinear dynamical systems. As one contribution of this paper, we apply Polya's algorithm to the problem of $H_\infty$ control of systems with parametric uncertainty. Numerical examples are provided to compare the accuracy of these algorithms with other polynomial optimization algorithms in the literature.


  • Open Access

    Constructing Piecewise Polynomial Lyapunov Functions for Local Stability of Nonlinear Systems Using Handelman's Theorem

    by Reza Kamyar, Chaitanya Murti, Matthew Peet

    In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.