منابع مشابه
Second-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملMeasuring second-order time-average pressure
Measurements of the spatial distribution of the time-averaged second-order pressure in a plane standing wave in atmospheric air are reported. Several measurement pitfalls are identified, and solutions are described. These include accounting for slight nonlinearity of the piezoresistive transducer and careful mounting of the transducer. Streaming causes extra complication when a capillary-connec...
متن کاملSecond Order Average Estimates on Local Data of Cusp Forms1
We specify sufficient conditions for the square modulus of the local parameters of a family of GLn cusp forms to be bounded on average. These conditions are global in nature and are satisfied for n ≤ 4. As an application, we show that Rankin-Selberg L-functions on GLn1 × GLn2 , for ni ≤ 4, satisfy the standard convexity bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2011
ISSN: 1027-5487
DOI: 10.11650/twjm/1500406494