搜索结果: 1-14 共查到“函数论 Optimization”相关记录14条 . 查询时间(0.031 秒)
Analysis of linear systems with saturation using convex optimization
Linear matrix inequality linear system the lyapunov function space area half plan
2015/8/11
We show how linear matrix inequalities (LMI) can be used to perform local stability and performance analysis of linear systems with saturating elements. This leads to conservative information on stabi...
Design and optimization of LC oscillators
Automation components transistor LC oscillator function
2015/8/11
We present a method for optimizing and automating component and transistor sizing for CMOS LC oscillators. We observe that the performance measures can be formulated as posynomial functions of the des...
Piecewise-affine state feedback for piecewise-affine slab systems using convex optimization
Piecewise-affine systems State feedback Convex optimization Ellipsoids Lyapunov function
2015/8/10
This paper shows that Lyapunov-based state feedback controller synthesis for piecewise-affine (PWA) slab systems can be cast as an optimization problem subject to a set of linear matrix inequalities (...
Optimization-based design and implementation of multi-dimensional zero-phase IIR filters
Design automation digital filters infinite-impulse response filters iterative methods multidimensional systems, optimization
2015/8/10
This paper considers multi-dimensional infinite impulse response (IIR) filters that are iteratively implemented. The focus is on zero-phase filters with symmetric polynomials in the numerator and deno...
Upper bounds on algebraic connectivity via convex optimization
Laplace operator matrix algebra connection Laplacian invariant subset matrix convex function
2015/8/10
The second smallest eigenvalue of the Laplacian matrix L of a graph is called its algebraic connectivity. We describe a method for obtaining an upper bound on the algebraic connectivity of a family of...
Operation and configuration of a storage portfolio via convex optimization
Convex optimization Predictive control Energy management systems
2015/8/7
We consider a portfolio of storage devices which is used to modify a commodity flow so as to minimize an average cost function. The individual storage devices have different parameters that characteri...
Block splitting for distributed optimization
Distributed computing convex optimization data large linear operator matrix machine
2015/8/7
This paper describes a general purpose method for solving convex optimization problems in a distributed computing environment. In particular, if the problem data includes a large linear operator or ma...
Convex optimization in Julia
Convex programming automati cerification symbolic computation multiple dispatch
2015/8/7
This paper describes Convex.jl, a convex optimization modeling framework in Julia. Convex.jl translates problems from a user-friendly functional language into an abstract syntax tree describing the pr...
A new look at nonnegativity on closed sets and polynomial optimization
closed sets nonnegative functions nonnegative polynomials semidefinite
2010/11/26
We first show that a continuous function f is nonnegative on a closed set K Rn if and only if (countably many) moment matrices of some signed measure d = fdμ with supp μ = K, are all positive semid...
Shape Optimization Problems over Classes of Convex Domains
Shape Optimization Problems Convex Domains
2009/2/5
We consider shape optimization problems of the form
\min\left\{\int_{\partial A} f(x,\nu(x))\hbox{d}x {\cal{H}^{n-1}} :A\in{\cal A}\right\}
where $f$ is any continuous function and the class ${\ca...
A Generalization of the Quasiconvex Optimization Problem
Quasiconvex Optimization Problem instead of functions convex minimization problem
2009/2/5
In this paper the quasiconvex minimization problem is included in a problem defined by sets (instead of functions). Lagrangian conditions for both problems are then studied and related. Lagrangian con...
Optimization of Positive Generalized Polynomials under $ \boldsymbol{l^p}$ Constraints
constrained optimization convex optimization combinatorial optimization subhomogeneous functions labeling
2009/1/23
The problem of maximizing a non-negative generalized polynomial of degree at most $p$ on the $l_p$-sphere is shown to be equivalent to a concave one. Arguments where the maximum is attained are charac...
Dykstra’s Algorithm as the Nonlinear Extension of Bregman's Optimization Method
Bregman projection convex programming Dykstra's algorithm
2009/1/22
We show that Dykstra's algorithm with Bregman projections, which finds the Bregman projection of a point onto the nonempty intersection of finitely many closed convex sets, is actually the nonlinear e...
Lipschitz Continuity of the State Function in a Shape Optimization Problem
Lipschitz State Function Optimization Problem
2009/1/20
This paper deals with the existence and the regularity of state function $u$ in an $N$-dimensional shape optimization problem. We use a variational approach to get the existence of a solution $u$ of a...