WorldWideScience

Sample records for convex quadratic mixed

  1. A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program

    OpenAIRE

    Xia, Yong; Han, Ying-Wei

    2014-01-01

    In this paper, we propose a mixed-binary convex quadratic programming reformulation for the box-constrained nonconvex quadratic integer program and then implement IBM ILOG CPLEX 12.6 to solve the new model. Computational results demonstrate that our approach clearly outperform the very recent state-of-the-art solvers.

  2. On Convex Quadratic Approximation

    NARCIS (Netherlands)

    den Hertog, D.; de Klerk, E.; Roos, J.

    2000-01-01

    In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

  3. On Convex Quadratic Approximation

    NARCIS (Netherlands)

    den Hertog, D.; de Klerk, E.; Roos, J.

    2000-01-01

    In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

  4. SMOOTHING BY CONVEX QUADRATIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Bing-sheng He; Yu-mei Wang

    2005-01-01

    In this paper, we study the relaxed smoothing problems with general closed convex constraints. It is pointed out that such problems can be converted to a convex quadratic minimization problem for which there are good programs in software libraries.

  5. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2007-01-01

    We consider equivalent reformulations of nonlinear mixed 0–1 optimization problems arising from a broad range of recent applications of topology optimization for the design of continuum structures and composite materials. We show that the considered problems can equivalently be cast as either...... linear or convex quadratic mixed 0–1 programs. The reformulations provide new insight into the structure of the problems and may provide a foundation for the development of new methods and heuristics for solving topology optimization problems. The applications considered are maximum stiffness design...

  6. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2004-01-01

    We consider equivalent reformulations of nonlinear mixed 0-1 optimization problems arising from a broad range of recent applications of topology optimization for the design of continuum structures and composite materials. It is shown that the considered problems may equivalently be cast as either...... linear or as convex quadratic mixed 0-1 programs. The reformulations provide new insight into the structure of the problems and may provide a foundation for the development of new methods and heuristics for solving topology optimization problems. The applications considered are maximum stiffness design...

  7. Designing Camera Networks by Convex Quadratic Programming

    KAUST Repository

    Ghanem, Bernard

    2015-05-04

    ​In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport). ​

  8. Team Decision Problems with Convex Quadratic Constraints

    OpenAIRE

    Gattami, Ather

    2015-01-01

    In this paper, we consider linear quadratic team problems with an arbitrary number of quadratic constraints in both stochastic and deterministic settings. The team consists of players with different measurements about the state of nature. The objective of the team is to minimize a quadratic cost subject to additional finite number of quadratic constraints. We first consider the problem of countably infinite number of players in the team for a bounded state of nature with a Gaussian distributi...

  9. Quadratic growth and stability in convex programming problems

    OpenAIRE

    Bonnans, J. Frederic; Ioffe, Alexander D.

    1994-01-01

    Projet PROMATH; Given a convex program with $C^2$ functions and a convex set $S$ of solutions to the problem, we give a second order condition which guarantees that the problem does not have solutions outside of $S$. This condition is interpreted as a characterization for the quadratic growth of the cost function. The crucial role in the proofs is played by a theorem describing a certain uniform regularity property of critical cones in smooth convex programs. We apply these results to the dis...

  10. Stochastic level-value approximation for quadratic integer convex programming

    Institute of Scientific and Technical Information of China (English)

    PENG Zheng; WU Dong-hua

    2008-01-01

    We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method to update the sample density functions. We also prove the asymptotic convergence of this algorithm, and re-port some numerical results to illuminate its effectiveness.

  11. Sparse Signal Recovery from Quadratic Measurements via Convex Programming

    OpenAIRE

    Li, Xiaodong; Voroninski, Vladislav

    2012-01-01

    In this paper we consider a system of quadratic equations ||^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x, i.e., at most k components of x are non-zero, then by solving a convex optimization program, we can solve for x up to a multiplicative constant with high probability, provided that k

  12. H2/l1混合优化问题的凸二次规划解法%Convex Quadratic Programming for Mixed H2/l1 Optimal Control

    Institute of Scientific and Technical Information of China (English)

    孔亚广; 吴俊; 孙优贤

    2001-01-01

    采用上逼近算法求解H2/l1混合优化问题。首先将其转化为有限维的凸二次规划问题,并利用Lemke互补转轴算法求解;然后逐次进行逼近。计算示例表明所得结果是正确的。%The mixed H2/l1 optimal control is dealt with. Lowerapproximation solution is used to solve it. First, it is converted into finite dimension convex quadratic programming, and solved with Lemke complementary pivoting algorithm. Then the dimension is added until the solution convergents. At last an example is given to prove this algorithm.

  13. Recognition of Graphs with Convex Quadratic Stability Number

    Science.gov (United States)

    Pacheco, Maria F.; Cardoso, Domingos M.

    2009-09-01

    A stable set of a graph is a set of mutually non-adjacent vertices. The determination of a maximum size stable set, which is called maximum stable set, and the determination of its size, which is called stability number, are central combinatorial optimization problems. However, given a nonnegative integer k, to determine if a graph G has a stable set of size k is NP-complete. In this paper we deal with graphs for which the stability number can be determined by solving a convex quadratic programming problem. Such graphs were introduced in [13] and are called graphs with convex-QP stability number. A few algorithmic techniques for the recognition of this type of graphs in particular families are presented.

  14. Neural network for solving convex quadratic bilevel programming problems.

    Science.gov (United States)

    He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

    2014-03-01

    In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network.

  15. Convex half-quadratic criteria and interacting auxiliary variables for image restoration.

    Science.gov (United States)

    Idier, J

    2001-01-01

    This paper deals with convex half-quadratic criteria and associated minimization algorithms for the purpose of image restoration. It brings a number of original elements within a unified mathematical presentation based on convex duality. Firstly, the Geman and Yang's and Geman and Reynolds's constructions are revisited, with a view to establishing the convexity properties of the resulting half-quadratic augmented criteria, when the original nonquadratic criterion is already convex. Secondly, a family of convex Gibbsian energies that incorporate interacting auxiliary variables is revealed as a potentially fruitful extension of the Geman and Reynolds's construction.

  16. Maximum matching by convex quadratic programming based o an adverse graph conjecture

    OpenAIRE

    Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.

    2012-01-01

    In this talk, we describe a procedure for determining a maximum stable set in a graph with convex-$QP$ stability number (which is a graph whose stability number can be determined by solving a convex quadratic programming problem) unless there is a subgraph for which neither the optimal value of the convex quadratic program nor the least adjacency eigenvalue changes when the neighborhood of any vertex is deleted. Such a graph is called adverse. Assuming the trueness of the adver...

  17. Convex quadratic programming applied to the stability number of a graph

    OpenAIRE

    Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.

    2012-01-01

    We deal with graphs whose stability number can be determined by a convex quadratic program and describe algorithmic techniques for the determination of maximum stabe sets in such graphs (except there is an induced subgraph with least adjacency eigenvalue and optimal value of the convex quadratic program not changing if the neighbourhood of any vertex is deleted). Such a graph is called adverse. Assuming that every adverse graph has convex-QP stability number, an algorithm for the recognition ...

  18. An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

    OpenAIRE

    Xuewen Mu; Yaling Zhang

    2015-01-01

    An alternating direction method is proposed for convex quadratic second-order cone programming problems with bounded constraints. In the algorithm, the primal problem is equivalent to a separate structure convex quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is ...

  19. SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The solution of quadratic programming problems is an importantissue in the field of mathematical programming and industrial applications. In this paper, we solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.

  20. An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

    Directory of Open Access Journals (Sweden)

    Xuewen Mu

    2015-01-01

    quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.

  1. A dual neural network for convex quadratic programming subject to linear equality and inequality constraints

    Science.gov (United States)

    Zhang, Yunong; Wang, Jun

    2002-06-01

    A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially convergent to optimal solutions of quadratic programming problems. In addition, compared to neural networks containing high-order nonlinear terms, the dynamic equation of the proposed dual neural network is piecewise linear, and the network architecture is thus much simpler. The global convergence behavior of the dual neural network is demonstrated by an illustrative numerical example.

  2. Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times

    Institute of Scientific and Technical Information of China (English)

    ZHANG Feng; CHEN Feng; TANG Guochun

    2004-01-01

    Scheduling unrelated parallel machines with controllable processing times subject to release times is investigated. Based on the convex quadratic programming relaxation and the randomized rounding strategy, a 2-approximation algorithm is obtained for a special case with the all-or-none property and then a 3-approximation algorithm is presented for general problem.

  3. A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Yu Qian; Huang Chongchao; Jiang Yan

    2006-01-01

    This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step,where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O(√nL) iteration complexity which is the best result for convex quadratic programming so far.

  4. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

    Science.gov (United States)

    Buchheim, Christoph; Caprara, Alberto; Lodi, Andrea

    We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problems with box constraints. The main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.

  5. Airborne gravimetry data sparse reconstruction via L1-norm convex quadratic programming

    Science.gov (United States)

    Yang, Ya-Peng; Wu, Mei-Ping; Tang, Gang

    2015-06-01

    In practice, airborne gravimetry is a sub-Nyquist sampling method because of the restrictions imposed by national boundaries, financial cost, and database size. In this study, we analyze the sparsity of airborne gravimetry data by using the discrete Fourier transform and propose a reconstruction method based on the theory of compressed sensing for large-scale gravity anomaly data. Consequently, the reconstruction of the gravity anomaly data is transformed to a L1-norm convex quadratic programming problem. We combine the preconditioned conjugate gradient algorithm (PCG) and the improved interior-point method (IPM) to solve the convex quadratic programming problem. Furthermore, a flight test was carried out with the homegrown strapdown airborne gravimeter SGA-WZ. Subsequently, we reconstructed the gravity anomaly data of the flight test, and then, we compared the proposed method with the linear interpolation method, which is commonly used in airborne gravimetry. The test results show that the PCG-IPM algorithm can be used to reconstruct large-scale gravity anomaly data with higher accuracy and more effectiveness than the linear interpolation method.

  6. A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations.

    Science.gov (United States)

    Xia, Youshen; Feng, Gang; Wang, Jun

    2004-09-01

    This paper presents a recurrent neural network for solving strict convex quadratic programming problems and related linear piecewise equations. Compared with the existing neural networks for quadratic program, the proposed neural network has a one-layer structure with a low model complexity. Moreover, the proposed neural network is shown to have a finite-time convergence and exponential convergence. Illustrative examples further show the good performance of the proposed neural network in real-time applications.

  7. A PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    梁昔明; 钱积新

    2002-01-01

    The simplified Newton method, at the expense of fast convergence, reduces the work required by Newton method by reusing the initial Jacobian matrix. The composite Newton method attempts to balance the trade-off between expense and fast convergence by composing one Newton step with one simplified Newton step. Recently, Mehrotra suggested a predictor-corrector variant of primal-dual interior point method for linear programming. It is currently the interiorpoint method of the choice for linear programming. In this work we propose a predictor-corrector interior-point algorithm for convex quadratic programming. It is proved that the algorithm is equivalent to a level-1 perturbed composite Newton method. Computations in the algorithm do not require that the initial primal and dual points be feasible. Numerical experiments are made.

  8. Using convex quadratic programming to model random media with Gaussian random fields

    Science.gov (United States)

    Quintanilla, John A.; Jones, W. Max

    2007-04-01

    Excursion sets of Gaussian random fields (GRFs) have been frequently used in the literature to model two-phase random media with measurable phase autocorrelation functions. The goal of successful modeling is finding the optimal field autocorrelation function that best approximates the prescribed phase autocorrelation function. In this paper, we present a technique which uses convex quadratic programming to find the best admissible field autocorrelation function under a prescribed discretization. Unlike previous methods, this technique efficiently optimizes over all admissible field autocorrelation functions, instead of optimizing only over a predetermined parametrized family. The results from using this technique indicate that the GRF model is significantly more versatile than observed in previous studies. An application to modeling a base-catalyzed tetraethoxysilane aerogel system given small-angle neutron scattering data is also presented

  9. A novel neural dynamical approach to convex quadratic program and its efficient applications.

    Science.gov (United States)

    Xia, Youshen; Sun, Changyin

    2009-12-01

    This paper proposes a novel neural dynamical approach to a class of convex quadratic programming problems where the number of variables is larger than the number of equality constraints. The proposed continuous-time and proposed discrete-time neural dynamical approach are guaranteed to be globally convergent to an optimal solution. Moreover, the number of its neurons is equal to the number of equality constraints. In contrast, the number of neurons in existing neural dynamical methods is at least the number of the variables. Therefore, the proposed neural dynamical approach has a low computational complexity. Compared with conventional numerical optimization methods, the proposed discrete-time neural dynamical approach reduces multiplication operation per iteration and has a large computational step length. Computational examples and two efficient applications to signal processing and robot control further confirm the good performance of the proposed approach.

  10. Global asymptotic stability analysis for delayed neural networks using a matrix-based quadratic convex approach.

    Science.gov (United States)

    Zhang, Xian-Ming; Han, Qing-Long

    2014-06-01

    This paper is concerned with global asymptotic stability for a class of generalized neural networks with interval time-varying delays by constructing a new Lyapunov-Krasovskii functional which includes some integral terms in the form of ∫(t-h)(t)(h-t-s)(j)ẋ(T)(s)Rjẋ(s)ds(j=1,2,3). Some useful integral inequalities are established for the derivatives of those integral terms introduced in the Lyapunov-Krasovskii functional. A matrix-based quadratic convex approach is introduced to prove not only the negative definiteness of the derivative of the Lyapunov-Krasovskii functional, but also the positive definiteness of the Lyapunov-Krasovskii functional. Some novel stability criteria are formulated in two cases, respectively, where the time-varying delay is continuous uniformly bounded and where the time-varying delay is differentiable uniformly bounded with its time-derivative bounded by constant lower and upper bounds. These criteria are applicable to both static neural networks and local field neural networks. The effectiveness of the proposed method is demonstrated by two numerical examples.

  11. Estimation of positive semidefinite correlation matrices by using convex quadratic semidefinite programming.

    Science.gov (United States)

    Fushiki, Tadayoshi

    2009-07-01

    The correlation matrix is a fundamental statistic that is used in many fields. For example, GroupLens, a collaborative filtering system, uses the correlation between users for predictive purposes. Since the correlation is a natural similarity measure between users, the correlation matrix may be used in the Gram matrix in kernel methods. However, the estimated correlation matrix sometimes has a serious defect: although the correlation matrix is originally positive semidefinite, the estimated one may not be positive semidefinite when not all ratings are observed. To obtain a positive semidefinite correlation matrix, the nearest correlation matrix problem has recently been studied in the fields of numerical analysis and optimization. However, statistical properties are not explicitly used in such studies. To obtain a positive semidefinite correlation matrix, we assume the approximate model. By using the model, an estimate is obtained as the optimal point of an optimization problem formulated with information on the variances of the estimated correlation coefficients. The problem is solved by a convex quadratic semidefinite program. A penalized likelihood approach is also examined. The MovieLens data set is used to test our approach.

  12. A Convex Optimization Method for Global Optimal Solution of Quadratic Programming Problem with Non-Convex Quadratic Constraints%求非凸二次约束二次规划全局解的凸规划方法

    Institute of Scientific and Technical Information of China (English)

    田朝薇; 宋海洲

    2011-01-01

    针对非凸二次约束二次规划(QCQP)问题,将问题中二次函数的凸函数部分保留,达到所得松弛规划的可行域更加紧致的目的,得到原问题更好的下界.利用正交变换的方法得到原问题的一个凸规划松弛模型,再利用分支定界算法求其全局最优解.根据问题的最优性和可行性原则,提出一种能整体删除或缩小算法迭代过程中产生的分割子区域的区域删减策略.数值算例表明,算法及区域删减策略均是有效的.%In this paper, we obtain a sharper low bound by reserving the part of the convex function of the quadratic function for a non-convex quadratic programming with non-convex quadratic constraints (QCQP). The QCQP problem is first transformed into a convex quadratic programming with linear constraints by employing the orthogonal transformation and then the latter is solved by the branch-bound method. In order to improve the convergence of the proposed algorithm, two region-prunning techniques are given to delete or contract the sub-regions in which does not contain the optimal solutions of QCQP according to the optimality and feasibility of the problem. The numerical results show that the proposed algorithm and the prunning techniques are effective.

  13. Non-differentiable multiobjective mixed symmetric duality under generalized convexity

    Directory of Open Access Journals (Sweden)

    Li Jueyou

    2011-01-01

    Full Text Available Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems are established for the model under some suitable assumptions of generalized convexity. Several special cases are also obtained. MS Classification: 90C32; 90C46.

  14. Constrained spacecraft reorientation using mixed integer convex programming

    Science.gov (United States)

    Tam, Margaret; Glenn Lightsey, E.

    2016-10-01

    A constrained attitude guidance (CAG) system is developed using convex optimization to autonomously achieve spacecraft pointing objectives while meeting the constraints imposed by on-board hardware. These constraints include bounds on the control input and slew rate, as well as pointing constraints imposed by the sensors. The pointing constraints consist of inclusion and exclusion cones that dictate permissible orientations of the spacecraft in order to keep objects in or out of the field of view of the sensors. The optimization scheme drives a body vector towards a target inertial vector along a trajectory that consists solely of permissible orientations in order to achieve the desired attitude for a given mission mode. The non-convex rotational kinematics are handled by discretization, which also ensures that the quaternion stays unity norm. In order to guarantee an admissible path, the pointing constraints are relaxed. Depending on how strict the pointing constraints are, the degree of relaxation is tuneable. The use of binary variables permits the inclusion of logical expressions in the pointing constraints in the case that a set of sensors has redundancies. The resulting mixed integer convex programming (MICP) formulation generates a steering law that can be easily integrated into an attitude determination and control (ADC) system. A sample simulation of the system is performed for the Bevo-2 satellite, including disturbance torques and actuator dynamics which are not modeled by the controller. Simulation results demonstrate the robustness of the system to disturbances while meeting the mission requirements with desirable performance characteristics.

  15. Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints

    Energy Technology Data Exchange (ETDEWEB)

    Zhang Yunong [School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510275 (China)], E-mail: zhynong@mail.sysu.edu.cn; Li Zhan [School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510275 (China)], E-mail: lizhan@mail2.sysu.edu.cn

    2009-04-20

    In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.

  16. Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints

    Science.gov (United States)

    Zhang, Yunong; Li, Zhan

    2009-04-01

    In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.

  17. On Linear Stability of Parametric Convex Quadratic Programming%参数凸二次规划的线性稳定性

    Institute of Scientific and Technical Information of China (English)

    王明征; 夏尊铨; 张立卫

    2003-01-01

    本文研究参数凸二次规划的最优解集的稳定性.首先给出参数数学规划的方向线性稳定的定义,然后利用集值映射的微分理论证明线性约束参数凸二次规划是线性稳定的.%We consider the optimal set mapping S(x) associated with a parametric convex quadratic programming problem depending on a parameter vector x. In this paper, we give a definition of directionally linear stability for parametric mathematical programming problems, and prove that a class of linear constrained parametric convex quadratic programming is linear stable by means of the differentiable theory, in the sense of Tyurin (1965) and Banks & Jacobs (1970), of set-valued mappings.

  18. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  19. Generalized Fenchel's Duality Theory and Optimality Conditions for the Minimization of A Convex Quadratic with Quadratic Constraints%二次凸规划的广义Fenchel定理与最优性条件

    Institute of Scientific and Technical Information of China (English)

    朱德通

    2000-01-01

    使用导出的广义Fenchel对偶理论,获得了带有二次凸约束的二次凸规划问题的广义对偶形式和定理及其Kuhn-Tucker条件.进一步建立了Celis-Dennis-Tapia的信赖域子问题的对偶形式和最优性条件.%Using the generalized Fenchel's duality theory,we derive generalized duality theorems and related Kuhn-Tucker conditions for the minimization of a convex quadratic with some quadratic constraints.Further,we establish the duality programming and optimality conditions of the Celis-Dennis-Tapia trust region problem.

  20. Item Pool Construction Using Mixed Integer Quadratic Programming (MIQP). GMAC® Research Report RR-14-01

    Science.gov (United States)

    Han, Kyung T.; Rudner, Lawrence M.

    2014-01-01

    This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information…

  1. A Projection and Contraction Method for Convex Quadratic Programming%凸二次规划的投影收缩算法

    Institute of Scientific and Technical Information of China (English)

    赵社峰; 费浦生; 李健

    2001-01-01

    With respect to general convex quadratic programming(CQP),we first combined the dual problem of(CQP) and proposed a necessary and sufficient condition.Then we gave an iterative projection and contraction method for(CQP)and proved the global convergence.%对于一般的凸二次规划问题,首先结合该问题的对偶问题给出了解的充分必要条件,然后给出了一种解决该问题的投影收缩算法,并证明了该投影收缩算法的总体收敛性.

  2. A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem.

    Science.gov (United States)

    Hu, Xiaolin; Zhang, Bo

    2009-04-01

    In this paper, a new recurrent neural network is proposed for solving convex quadratic programming (QP) problems. Compared with existing neural networks, the proposed one features global convergence property under weak conditions, low structural complexity, and no calculation of matrix inverse. It serves as a competitive alternative in the neural network family for solving linear or quadratic programming problems. In addition, it is found that by some variable substitution, the proposed network turns out to be an existing model for solving minimax problems. In this sense, it can be also viewed as a special case of the minimax neural network. Based on this scheme, a k-winners-take-all ( k-WTA) network with O(n) complexity is designed, which is characterized by simple structure, global convergence, and capability to deal with some ill cases. Numerical simulations are provided to validate the theoretical results obtained. More importantly, the network design method proposed in this paper has great potential to inspire other competitive inventions along the same line.

  3. Hidden conic quadratic representation of some nonconvex quadratic optimization problems

    NARCIS (Netherlands)

    Ben-Tal, A.; den Hertog, D.

    2014-01-01

    The problem of minimizing a quadratic objective function subject to one or two quadratic constraints is known to have a hidden convexity property, even when the quadratic forms are indefinite. The equivalent convex problem is a semidefinite one, and the equivalence is based on the celebrated S-lemma

  4. Unified solution of a non-convex SCUC problem using combination of modified Branch-and-Bound method with Quadratic Programming

    Energy Technology Data Exchange (ETDEWEB)

    Shafie-khah, M., E-mail: m.shafie@modares.ac.ir [Department of Electrical and Computer Engineering, Tarbiat Modares University, P.O. Box: 14115-194, Tehran (Iran, Islamic Republic of); Parsa Moghaddam, M., E-mail: parsa@modares.ac.ir [Department of Electrical and Computer Engineering, Tarbiat Modares University, P.O. Box: 14115-194, Tehran (Iran, Islamic Republic of); Sheikh-El-Eslami, M.K., E-mail: aleslam@modares.ac.ir [Department of Electrical and Computer Engineering, Tarbiat Modares University, P.O. Box: 14115-194, Tehran (Iran, Islamic Republic of)

    2011-11-15

    Highlights: {yields} A hybrid SCUC solution is developed to deal with large-scale, real-time and long-term problems. {yields} New formulations are proposed for considering valve point effect and warmth-dependent start-up cost. {yields} A new algorithm is developed for modeling the AC power flow in SCUC problems. {yields} Using the power flow algorithm both steps in traditional SCUC is done simultaneously. {yields} The proposed method provides better solutions than previous ones with a fast speed. - Abstract: In this paper, a new practical method is presented for solving the non-convex security constraint unit commitment (SCUC) problem in power systems. The accuracy of the proposed method is desirable while the shorter computation time makes it useful for SCUC solution of large-scale power systems, real-time market operation and long-term SCUC problems. The proposed framework allows inclusion of the valve point effects, warmth-dependent start-up costs, ramp rates, minimum up/down time constraints, multiple fuels costs, emission costs, prohibited operating zones and AC power flow limits in normal and contingency conditions. To solve the non-convex problem, combination of a modified Branch-and-Bound method with the Quadratic Programming is used as an optimization tool and a developed AC power flow algorithm is applied for considering the security and contingency concerns using the nonlinear/linear AC model. These modifications improve the convergence speed and solution precision of SCUC problem. In the proposed method, in contrast with traditional SCUC algorithms, unit commitment solution, checking and satisfying the security constraints are managed simultaneously. The obtained results are compared with other reported methods for investigating the effectiveness of the proposed method. Also, the proposed method is applied to an Iranian power system including 493 thermal units.

  5. Verifiable and secure outsourcing protocol for convex quadratic programming%可验证的凸二次规划安全外包协议

    Institute of Scientific and Technical Information of China (English)

    刘振华; 李宾; 白翠翠

    2016-01-01

    To reduce the computation required for resource⁃constrained clients when performing convex quadratic programming, we propose an outsourcing computation protocol for convex quadratic programming whose security can be verified. In the new protocol, the client first utilizes a permutation technique to transform the original problem in⁃to a new random problem, which the cloud server receives and solves, and the client then verifies the returned re⁃sults. Thus, the new protocol can reduce the client's amount of required computation. Security analysis shows that the proposed protocol can protect the privacy of the input and output data, and detect any misbehavior by the cloud server to indicate the probability of a malicious model. Experimental results show that the new protocol has a com⁃parative advantage over existing protocols in its transformation and verification efficiency.%为了降低资源受限用户求解凸二次规划问题的计算量,提出了可验证安全的凸二次规划外包计算协议。新协议首次引入置换技术,将原始问题盲化转换成随机问题,然后外包给云服务器求解,最后验证服务器返回结果,减少了用户端的计算量。安全性分析表明,在完全恶意模型下,新协议可以保证输入输出数据的隐私性,且能以最优的概率检测出云服务器的不诚实行为。仿真实验表明,与现有协议相比,新协议中用户在转换和验证阶段所需时间明显降低。

  6. Integer Quadratic Quasi-polyhedra

    Science.gov (United States)

    Letchford, Adam N.

    This paper introduces two fundamental families of 'quasi-polyhedra' - polyhedra with a countably infinite number of facets - that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, along with connections to some other well-studied convex sets. Several classes of facet-inducing inequalities are also derived. Finally, extensions to the mixed-integer case are briefly examined.

  7. A QUASI-SIMPLEX METHOD FOR STRICTLY CONVEX QUADRATIC PROGRAMMING%严格凸二次规划的拟单纯解法

    Institute of Scientific and Technical Information of China (English)

    聂义勇; Magu.,SO

    2001-01-01

    In this paper, a robust method of directly searching the optimum objective point for strictly convex quadratic programming is presented, while no Kuhn-Tucker condition is applied to the solution. During the searching procedure the objective point is moved along a broken line on the boundary of the constraint polyhedron. This idea moving the objective point may be considered a natural generalization of the simplex method for linear programming where the objective point is moved from a vertex to another.%本文提出一个不用Kuhn-Tucker务件而直接搜索严格凸二次规划最优目标点的鲁棒方法.在搜索过程中,目标点沿约束多面体边界上的一条折线移动。这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广,在单纯形法中,目标点从一个顶点移到另一个顶点。

  8. A New Full-Newton Step Interior-point Algorithm for Convex Quadratic Semi-definite Programming%一种新的求解CQSDP的全-Newton步内点算法

    Institute of Scientific and Technical Information of China (English)

    李鑫; 季萍; 张明望

    2015-01-01

    In this paper, we propose a new full-Newton step primal-dual interior-point algorithm for solving convex quadratic semi-definite programming. By establishing and using new technical results, we show that the iteration complexity of algorithm asO(nlogn)ε is as good as the currently best iteration complexity for small-update interior-point algorithms of convex quadratic semi-definite programming.%对凸二次半定规划提出了一种新的全-Newton步原始-对偶内点算法.通过建立和应用一些新的技术性结果,证明了算法的迭代复杂性为O( n log n )ε ,这与目前凸二次半定规划的小步校正内点算法最好的迭代复杂性一致.

  9. AN INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING PROBLEM WITH BOX CONSTRAINTS%框式约束凸二次规划问题的内点算法

    Institute of Scientific and Technical Information of China (English)

    张艺

    2002-01-01

    In this paper,a primal-dual interior point algorithm for convex quadratic progromming problem with box constrains is presented.It can be started at any primal-dual interior feasible point.If the initial point is close to the central path,it becomes a central path-following alogorithm and requires a total of O(√nL)number of iterations,where L is the input length.

  10. Optical linear response function with linear and diagonal quadratic electron-vibration coupling in mixed quantum-classical systems.

    Science.gov (United States)

    Toutounji, Mohamad

    2004-08-01

    Optical linear response function of linearly and quadratically coupled mixed quantum-classical condensed phase systems is derived. The linear response function is derived using Kapral's formalism of statistical mechanics in mixed quantum-classical systems. Our mixed quantum-classical linear dipole moment correlation function J(t) is compared with the full quantum J(t) [Y. J. Yan and S. Mukamel, J. Chem. Phys. 85, 5908 (1986)] in the high temperature limit. Model calculations and discussion of our results are presented. Various formulas of Franck-Condon factors for both linear and quadratic coupling are discussed. (c) 2004 American Institute of Physics.

  11. On Characterization of Quadratic Splines

    DEFF Research Database (Denmark)

    Chen, B. T.; Madsen, Kaj; Zhang, Shuzhong

    2005-01-01

    that the representation can be refined in a neighborhood of a non-degenerate point and a set of non-degenerate minimizers. Based on these characterizations, many existing algorithms for specific convex quadratic splines are also finite convergent for a general convex quadratic spline. Finally, we study the relationship...

  12. On Characterization of Quadratic Splines

    DEFF Research Database (Denmark)

    Chen, B. T.; Madsen, Kaj; Zhang, Shuzhong

    2005-01-01

    A quadratic spline is a differentiable piecewise quadratic function. Many problems in numerical analysis and optimization literature can be reformulated as unconstrained minimizations of quadratic splines. However, only special cases of quadratic splines are studied in the existing literature...... between the convexity of a quadratic spline function and the monotonicity of the corresponding LCP problem. It is shown that, although both conditions lead to easy solvability of the problem, they are different in general......., and algorithms are developed on a case by case basis. There lacks an analytical representation of a general or even a convex quadratic spline. The current paper fills this gap by providing an analytical representation of a general quadratic spline. Furthermore, for convex quadratic spline, it is shown...

  13. 框式凸二次规划的原始-对偶不可行内点算法%A Primal-dual Infeasible Interior Point Algorithm for Convex Quadratic Programming Problem with Box Constraints

    Institute of Scientific and Technical Information of China (English)

    张明望; 黄崇超

    2001-01-01

    In this paper, we devise a primal-dual infeasible interior point algorithm for convex quadratic programming problem with box constraints.Under assumption that initial point is in neighborhood of the path of conters,we prove that algorithm enjoys the global convergence.%对框式凸二次规划提出了一种原始—对偶不可行内点算法,在初始点取在中心路径的邻域N时,证明了算法的全局收敛性。

  14. A Discussion of Concavo-Convex Contacts between Oolites and Quartz Grains in Mixed Siliciclastic-Carbonate Rocks in Huanghua Basin, China

    Institute of Scientific and Technical Information of China (English)

    Ma Yanping; Liu Li

    2002-01-01

    Concavo-convex contacrs between oolites and quartz grains are observed in mixed siliciclastic-carbonate rocks of the lower part of number 1 of Shahejie Formation, beach area, Dagang. Thin sections observation shows that oolite is convex in quartz grain, and oolite is complete. A possible explanation for it is pressure dissolution under alkaline fluid.

  15. Optical nonlinear response function with linear and diagonal quadratic electron-vibration coupling in mixed quantum-classical systems.

    Science.gov (United States)

    Toutounji, Mohamad

    2005-03-22

    While an optical linear response function of linearly and quadratically coupled mixed quantum-classical condensed-phase systems was derived by Toutounji [J. Chem. Phys. 121, 2228 (2004)], the corresponding analytical optical line shape is derived. The respective nonlinear correlation functions are also derived. Model calculations involving photon-echo, pump-probe, and hole-burning signals of model systems with both linear and quadratic coupling are provided. Hole-burning formula of Hayes-Small is compared to that of Mukamel in mixed quantum-classical systems.

  16. Extending the Scope of Robust Quadratic Optimization

    NARCIS (Netherlands)

    Marandi, Ahmadreza; Ben-Tal, A.; den Hertog, Dick; Melenberg, Bertrand

    2017-01-01

    In this paper, we derive tractable reformulations of the robust counterparts of convex quadratic and conic quadratic constraints with concave uncertainties for a broad range of uncertainty sets. For quadratic constraints with convex uncertainty, it is well-known that the robust counterpart is, in ge

  17. Footstep Planning on Uneven Terrain with Mixed-Integer Convex Optimization

    Science.gov (United States)

    2014-08-01

    variables to absorb any non-convex constraints. We handle orientation of the footstep placements by approximating the trigonometric sin and cos...must enforce that sj and cj approximate sin and cos without introducing non-convex trigonometric constraints. We choose instead to create a simple...goal and identical cost weights on the displacement from each footstep to the next. To control the number of footsteps used in the plan, and thus the

  18. Interior-point Algorithm for Convex Quadratic Programming Based on A New Class of Kernel Functions%基于新的核函数求解凸二次规划的内点算法

    Institute of Scientific and Technical Information of China (English)

    李鑫

    2016-01-01

    Based on a new class of kernel functions,a large-update primal-dual interior-point algorithm for convex quadratic programming is presented.By using new technical results and favorable properties of the kernel function, the study proves that the iteration complexity for the algorithm is On1/2lognlogn/ε, which is identical with the currently best iteration bound for large-update primal-dual interior-point algorithms of convex quadratic programming.%基于一类新的核函数对凸二次规划(CQP)设计了一种大步校正内点算法。通过应用新的技术性结果和这类核函数良好的性质,证明了算法的迭代复杂性为 O(n1/2lognlogn/ε),这与目前凸二次规划的大步校正原始-对偶内点算法最好的迭代复杂性一致。

  19. A Priori Error Estimates of Mixed Finite Element Methods for General Linear Hyperbolic Convex Optimal Control Problems

    Directory of Open Access Journals (Sweden)

    Zuliang Lu

    2014-01-01

    Full Text Available The aim of this work is to investigate the discretization of general linear hyperbolic convex optimal control problems by using the mixed finite element methods. The state and costate are approximated by the k order (k≥0 Raviart-Thomas mixed finite elements and the control is approximated by piecewise polynomials of order k. By applying the elliptic projection operators and Gronwall’s lemma, we derive a priori error estimates of optimal order for both the coupled state and the control approximation.

  20. A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

    Science.gov (United States)

    Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

    2005-01-01

    We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

  1. A New Primal-Dual Polynomial Algorithm for Convex Quadratic Programming%一种新的求解凸二次规划的原始-对偶多项式内点算法

    Institute of Scientific and Technical Information of China (English)

    龚小玉; 胡振鹏; 王先甲

    2012-01-01

    In this paper,we present a new primal-dual path-following method to solve the convex quadratic programming. The new method is based on a technique for finding the search directions not different to the classical Newton method. At last,we prove that the algorithm has polynomial-time complexity.%对凸二次规划问题提出了一种新的原始-对偶路径跟踪算法,算法迭代方向的求解是不同于传统的牛顿法,而是借助于一种新的工具找到搜寻方向.最后证明了算法具有多项式复杂性.

  2. Multistage quadratic stochastic programming

    Science.gov (United States)

    Lau, Karen K.; Womersley, Robert S.

    2001-04-01

    Quadratic stochastic programming (QSP) in which each subproblem is a convex piecewise quadratic program with stochastic data, is a natural extension of stochastic linear programming. This allows the use of quadratic or piecewise quadratic objective functions which are essential for controlling risk in financial and project planning. Two-stage QSP is a special case of extended linear-quadratic programming (ELQP). The recourse functions in QSP are piecewise quadratic convex and Lipschitz continuous. Moreover, they have Lipschitz gradients if each QP subproblem is strictly convex and differentiable. Using these properties, a generalized Newton algorithm exhibiting global and superlinear convergence has been proposed recently for the two stage case. We extend the generalized Newton algorithm to multistage QSP and show that it is globally and finitely convergent under suitable conditions. We present numerical results on randomly generated data and modified publicly available stochastic linear programming test sets. Efficiency schemes on different scenario tree structures are discussed. The large-scale deterministic equivalent of the multistage QSP is also generated and their accuracy compared.

  3. 等式约束凸二次规划解析的新型神经网络方法%Method of new neural network for solving convex quadratic programming with equality constraints

    Institute of Scientific and Technical Information of China (English)

    易称福; 陈宇环; 张小红

    2011-01-01

    针对不同于传统基于梯度法的递归神经网络定义一种基于标量范数取值的非负能量函数,通过定义一种基于向量取值的不定无界的误差函数,构建了一种能实时求解具有线性等式约束的凸二次规划问题.基于Simulink仿真平台的计算机实验结果表明,该新型神经网络模型能够准确有效地求解此类二次规划问题.%Differing from the conventional gradient-based recurrent neural networks, which associated with scalar-valued norm-based nonnegative energy function, by defining an indefinite error function based on the vector-valued, presented a new neural network for the online solution of the convex quadratic programming problem with equality constrains. Computer simulation results based on the Simulink show that the new neural networks can solve such quadratic programming with effectiveness and accuracy.

  4. SHARP BOUNDS FOR NEUMAN-S ´ANDOR MEAN IN TERMS OF THE CONVEX COMBINATION OF QUADRATIC AND FIRST SEIFFERT MEANS

    Institute of Scientific and Technical Information of China (English)

    褚玉明; 赵铁洪; 宋迎清˜

    2014-01-01

    In this article, we prove that the double inequality P(a, b) + (1 - )Q(a, b) 0 with a 6= b if and only if ≥ 1/2 and ≤ [(√ 2 log(1 +√ 2) - 1)]/[(√ 2-2) log(1+√ 2)] = 0.3595 · · · , where M(a, b), Q(a, b), and P(a, b) are the Neuman- S´andor, quadratic, and first Seiffert means of a and b, respectively.

  5. Convex Minimization with Constraints of Systems of Variational Inequalities, Mixed Equilibrium, Variational Inequality, and Fixed Point Problems

    Directory of Open Access Journals (Sweden)

    Lu-Chuan Ceng

    2014-01-01

    Full Text Available We introduce and analyze one iterative algorithm by hybrid shrinking projection method for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: finitely many generalized mixed equilibrium problems, finitely many variational inequalities, the general system of variational inequalities and the fixed point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another iterative algorithm by hybrid shrinking projection method for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

  6. Convex Grooves in Staggered Herringbone Mixer Improve Mixing Efficiency of Laminar Flow in Microchannel.

    Science.gov (United States)

    Kwak, Tae Joon; Nam, Young Gyu; Najera, Maria Alejandra; Lee, Sang Woo; Strickler, J Rudi; Chang, Woo-Jin

    2016-01-01

    The liquid streams in a microchannel are hardly mixed to form laminar flow, and the mixing issue is well described by a low Reynolds number scheme. The staggered herringbone mixer (SHM) using repeated patterns of grooves in the microchannel have been proved to be an efficient passive micro-mixer. However, only a negative pattern of the staggered herringbone mixer has been used so far after it was first suggested, to the best of our knowledge. In this study, the mixing efficiencies from negative and positive staggered herringbone mixer patterns as well as from opposite flow directions were tested to investigate the effect of the micro-structure geometry on the surrounding laminar flow. The positive herringbone pattern showed better mixing efficiency than the conventionally used negative pattern. Also, generally used forward flow gives better mixing efficiency than reverse flow. The mixing was completed after two cycles of staggered herringbone mixer with both forward and reverse flow in a positive pattern. The traditional negative pattern showed complete mixing after four and five cycles in forward and reverse flow direction, respectively. The mixing effect in all geometries was numerically simulated, and the results confirmed more efficient mixing in the positive pattern than the negative. The results can further enable the design of a more efficient microfluidic mixer, as well as in depth understanding of the phenomena of positive and negative patterns existing in nature with regards to the surrounding fluids.

  7. Convexity Adjustments

    DEFF Research Database (Denmark)

    M. Gaspar, Raquel; Murgoci, Agatha

    2010-01-01

    of particular importance to practitioners: yield convexity adjustments, forward versus futures convexity adjustments, timing and quanto convexity adjustments. We claim that the appropriate way to look into any of these adjustments is as a side effect of a measure change, as proposed by Pelsser (2003...

  8. Undergraduate Convexity

    DEFF Research Database (Denmark)

    Lauritzen, Niels

    -Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point...

  9. Convex Graph Invariants

    Science.gov (United States)

    2010-12-02

    evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in

  10. 线性约束非凸二次规划的有限分支定界算法%A Finite Branch-and-bound Algorithm for Non-convex Quadratic Programming with Linear Constraints

    Institute of Scientific and Technical Information of China (English)

    田朝薇; 宋海洲

    2012-01-01

    针对线性约束非凸二次规划问题,从其KKT点出发得到它的一个线性松弛规划,并递归地向该松弛规划中加入原问题的互补松弛条件的线性等式,从而得到一个有限分支定界算法,并对其收敛性进行了证明,经数值实验表明该算法是有效的.%In this paper,we obtain a linear programming relaxation from Karush-Kuhn-Tucker(KKT) point for non-convex quadratic programming with linear constraints.Thus we propose a finite branch-and-bound algorithm by adding recursively the linear equations of the complementarity constraints of the primal problem to the relaxation programming.Therefore,the convergence of the algorithm is proved and the numerical computations show that the proposed algorithm is effective.

  11. 凸二次规划的一个改进的Mehrotra型预估-校正算法%ON MEHROTRA-TYPE PREDICTOR-CORRECTOR ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    赵玉琴; 张明望; 周意元

    2011-01-01

    Mehrotra-type predictor-corrector algorithms are the backbone of the most interior point methods based on the software packages. Recently Salahi et al. Consider a variant of Mehrotra's celebrated predictor-corrector algorithm for linear optimization problem. By a numerical example they show that this variant might make very small steps in order to keep the iterate in a certain neightbor-hood of the central path that itself implies the inefficiency of the algorithm. This observation motivat them to incorporate safeguard in their algorithm scheme that gives a lower bound for the step size at each iteration and thus implies polynomial iteration complexity. This paper extends their modified approach to the convex quadratic programming. As the search directions Δχ and Δs are not orthogonal any more, the complexity analysis of the method is different from that of linear programming, correspondingly. We prove that the extended algorithm, in the worst case, will terminate after at most O(nlog((χυ)Ts0)/ε) iterations.

  12. Robust Solutions of Uncertain Complex-valued Quadratically Constrained Programs

    Institute of Scientific and Technical Information of China (English)

    Da Chuan XU; Zheng Hai HUANG

    2008-01-01

    In this paper,we discuss complex convex quadratically constrained optimization with uncertain data.Using S-Lemma,we show that the robust counterpart of complex convex quadratically constrained optimization with ellipsoidal or intersection-of-two-ellipsoids uncertainty set leads to a complex semidefinite program.By exploring the approximate S-Lemma,we give a complex semidefinite program which approximates the NP-hard robust counterpart of complex convex quadratic optimization with intersection-of-ellipsoids uncertainty set.

  13. A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints

    NARCIS (Netherlands)

    Han, Lanshan; Camlibel, M. Kanat; Pang, Jong-Shi; Heemels, W. P. Maurice H.

    2012-01-01

    This paper presents a numerical scheme for solving the continuous-time convex linear-quadratic (LQ) optimal control problem with mixed polyhedral state and control constraints. Unifying a discretization of this optimal control problem as often employed in model predictive control and that obtained

  14. Triple Hierarchical Variational Inequalities with Constraints of Mixed Equilibria, Variational Inequalities, Convex Minimization, and Hierarchical Fixed Point Problems

    Directory of Open Access Journals (Sweden)

    Lu-Chuan Ceng

    2014-01-01

    Full Text Available We introduce and analyze a hybrid iterative algorithm by virtue of Korpelevich's extragradient method, viscosity approximation method, hybrid steepest-descent method, and averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs, the solution set of finitely many variational inequality problems (VIPs, the solution set of general system of variational inequalities (GSVI, and the set of minimizers of convex minimization problem (CMP, which is just a unique solution of a triple hierarchical variational inequality (THVI in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solve a hierarchical fixed point problem with constraints of finitely many GMEPs, finitely many VIPs, GSVI, and CMP. The results obtained in this paper improve and extend the corresponding results announced by many others.

  15. A mixing-length model for the prediction of convex curvature effects on turbulent boundary layers. [for turbine blade convective heat transfer prediction

    Science.gov (United States)

    Adams, E. W.; Johnston, J. P.

    1983-01-01

    A mixing-length model is developed for the prediction of turbulent boundary layers with convex streamwise curvature. For large layer thickness ratio, delta/R greater than 0.05, the model scales mixing length on the wall radius of curvature, R. For small delta/R, ordinary flat wall modeling is used for the mixing-length profile with curvature corrections, following the recommendations of Eide and Johnston (1976). Effects of streamwise change of curvature are considered; a strong lag from equilibrium is required when R increases downstream. Fifteen separate data sets were compared, including both hydrodynamic and heat transfer results. Six of these computations are presented and compared to experiment.

  16. A second-order Mehrotra-type predictor-corrector algorithm for solving convex quadratic programming%求解凸二次规划的一种二阶Mehrotra型预估-校正算法

    Institute of Scientific and Technical Information of China (English)

    胡强; 张明望; 李卫滑

    2011-01-01

    A second-order Mehrotra-type predictor-corrector algorithm for solving convex quadratic programming is presented. Based on the work of Salahi et al., a safe strategy is introduced in the algorithm, which guarantees a positive desirable lower bound for the maximum feasible step in the corrector step and subsequently polynomial complexity.Since the search directions of the algorithm are not orthogonal, the way of computing the barrier parameter, as well as the complexity analysis is different from that in the linear case. Finally, through some technical lemmas, it is shown that the iteration complexity of the algorithm is O( n3/2 log (x0)TS0/ε ) in the worst case.%给出了求解凸二次规划的一种二阶Mehrotra型预估-校正算法.该算法受Salahi等人对线性规划提出的相应算法启发,引入了安全步策略,保证了校正步步长有适当下界,从而具有多项式复杂性.由于算法迭代方向不正交,算法在罚参数的校正和复杂性的分析上有别于线性规划的情形.最后,通过一些新的技术性引理,证明了算法在最坏情况下的迭代复杂性为O(n3/2log(x0)TS0/ε).

  17. Semidefinite programming for quadratically constrained quadratic programs

    Science.gov (United States)

    Olkin, Julia A.; Titterton, Paul J., Jr.

    1995-06-01

    We consider the linear least squares problem subject to multiple quadratic constraints, which is motivated by a practical application in controller design. We use the techniques of convex optimization, in particluar, interior-point methods for semi-definite programming. We reduce a quasi-convex potential function. Each iteration requires calculating a primal and dual search direction and minimizing along the plane defined by these search directions. The primal search direction requires solving a least squares problem whose matrix is composed of a block- Toeplitz portion plus other structured matrices. We make use of Kronecker products and FFTs to greatly reduce the calculation. In addition, the matrix updates and matrix inverses in the plane search are actually low-rank updates to structured matrices so we are able to further reduce the flops required. Consequently, we can design controllers for problems of considerable size.

  18. Collaborative Research: Further Developments in the Global Resolution of Convex Programs with Complementary Contraints

    Science.gov (United States)

    2014-10-31

    constrained quadratic program can be lifted to a convex conic optimization prob- lem. We have shown that a complementarity approach can be used to find sparse...students who were partially supported by this grant have graduated from RPI or UIUC: • Lijie Bai, On convex quadratic programs with complementarity...conferences and universities. In paper [A], we show that any quadratically constrained quadratic program is equivalent to a convex optimization problem

  19. Reverse convex problems: an approach based on optimality conditions

    Directory of Open Access Journals (Sweden)

    Ider Tseveendorj

    2006-01-01

    Full Text Available We present some results concerning reverse convex problems. Global optimality conditions for the problems with a nonsmooth reverse convex constraint are established and convergence of an algorithm in the case of linear program with an additional quadratic reverse convex constraint is studied.

  20. Reverse convex problems: an approach based on optimality conditions

    OpenAIRE

    Ider Tseveendorj

    2006-01-01

    We present some results concerning reverse convex problems. Global optimality conditions for the problems with a nonsmooth reverse convex constraint are established and convergence of an algorithm in the case of linear program with an additional quadratic reverse convex constraint is studied.

  1. Optimization with quadratic support functions in nonconvex smooth optimization

    Science.gov (United States)

    Khamisov, O. V.

    2016-10-01

    Problem of global minimization of twice continuously differentiable function with Lipschitz second derivatives over a polytope is considered. We suggest a branch and bound method with polytopes as partition elements. Due to the Lipschitz property of the objective function we can construct a quadratic support minorant at each point of the feasible set. Global minimum of of this minorant provides a lower bound of the objective over given partition subset. The main advantage of the suggested method consists in the following. First quadratic minorants usually are nonconvex and we have to solve auxiliary global optimization problem. This problem is reduced to a mixed 0-1 linear programming problem and can be solved by an advanced 0-1 solver. Then we show that the quadratic minorants are getting convex as soon as partition elements are getting smaller in diameter. Hence, at the final steps of the branch and bound method we solve convex auxiliary quadratic problems. Therefore, the method accelerates when we are close to the global minimum of the initial problem.

  2. A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

    Science.gov (United States)

    Tang, Chun-Ming; Jian, Jin-Bao

    2008-10-01

    Based on an augmented Lagrangian line search function, a sequential quadratically constrained quadratic programming method is proposed for solving nonlinearly constrained optimization problems. Compared to quadratic programming solved in the traditional SQP methods, a convex quadratically constrained quadratic programming is solved here to obtain a search direction, and the Maratos effect does not occur without any other corrections. The "active set" strategy used in this subproblem can avoid recalculating the unnecessary gradients and (approximate) Hessian matrices of the constraints. Under certain assumptions, the proposed method is proved to be globally, superlinearly, and quadratically convergent. As an extension, general problems with inequality and equality constraints as well as nonmonotone line search are also considered.

  3. Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints

    OpenAIRE

    Goberna, Miguel A.; Jeyakumar, Vaithilingam; Li, Guoyin; Linh, Nguyen

    2016-01-01

    The radius of robust feasibility of a convex program with uncertain constraints gives a value for the maximal ‘size’ of an uncertainty set under which robust feasibility can be guaranteed. This paper provides an upper bound for the radius for convex programs with uncertain convex polynomial constraints and exact formulas for convex programs with SOS-convex polynomial constraints (or convex quadratic constraints) under affine data uncertainty. These exact formulas allow the radius to be comput...

  4. An Algorithm for Solving Quadratic Programming Problems

    Directory of Open Access Journals (Sweden)

    V. Moraru

    1997-08-01

    Full Text Available Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems.

  5. Further Development in the Global Resolution of Convex Programs with Complementarity Constraints

    Science.gov (United States)

    2014-04-09

    variables, we have investigated the class of convex quadratic programs with complementarity constraints (QPCCs) and be- gun to explore the global...published; all are available from http://www.rpi. edu/~mitchj: • L. Bai, J.E. Mitchell, and J.S. Pang. On convex quadratic programs with linear...relationship of a pair of convex quadratic programs and on a logical Benders scheme, an extreme ray/point generation procedure is developed, which

  6. A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

    DEFF Research Database (Denmark)

    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.

    1999-01-01

    The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems...

  7. Cubes convexes

    CERN Document Server

    Nedjar, Sebastien; Cicchetti, Rosine; Lakhal, Lotfi; 10.3166/isi.11.6.11-31

    2010-01-01

    In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the concept of convex cube which captures all the tuples of a datacube satisfying a constraint combination. It can be represented in a very compact way in order to optimize both computation time and required storage space. The convex cube is not an additional structure appended to the list of cube variants but we propose it as a unifying structure that we use to characterize, in a simple, sound and homogeneous way, the other quoted types of cubes. Finally, we introduce the concept of emerging cube which captures the significant trend inversions. characterizations.

  8. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

    CERN Document Server

    Lee, Jon; Romanchuk, Lyubov; Weismantel, Robert

    2010-01-01

    We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the system is given, and the quadratic function lies in a suitable {\\em dual Graver cone}, the problem can be solved in polynomial time. We discuss the relation between this cone and the cone of positive semidefinite matrices, and show that none contains the other. So we can minimize in polynomial time some non-convex and some (including all separable) convex quadrics. We conclude by extending our results to efficient integer minimization of multivariate polynomial functions of arbitrary degree lying in suitable cones.

  9. Consensus-ADMM for General Quadratically Constrained Quadratic Programming

    Science.gov (United States)

    Huang, Kejun; Sidiropoulos, Nicholas D.

    2016-10-01

    Non-convex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special cases are NP-hard as well. This paper proposes a new algorithm for general QCQP. The problem is first reformulated in consensus optimization form, to which the alternating direction method of multipliers (ADMM) can be applied. The reformulation is done in such a way that each of the sub-problems is a QCQP with only one constraint (QCQP-1), which is efficiently solvable irrespective of (non-)convexity. The core components are carefully designed to make the overall algorithm more scalable, including efficient methods for solving QCQP-1, memory efficient implementation, parallel/distributed implementation, and smart initialization. The proposed algorithm is then tested in two applications: multicast beamforming and phase retrieval. The results indicate superior performance over prior state-of-the-art methods.

  10. Comparison of two non-convex mixed-integer nonlinear programming algorithms applied to autoregressive moving average model structure and parameter estimation

    Science.gov (United States)

    Uilhoorn, F. E.

    2016-10-01

    In this article, the stochastic modelling approach proposed by Box and Jenkins is treated as a mixed-integer nonlinear programming (MINLP) problem solved with a mesh adaptive direct search and a real-coded genetic class of algorithms. The aim is to estimate the real-valued parameters and non-negative integer, correlated structure of stationary autoregressive moving average (ARMA) processes. The maximum likelihood function of the stationary ARMA process is embedded in Akaike's information criterion and the Bayesian information criterion, whereas the estimation procedure is based on Kalman filter recursions. The constraints imposed on the objective function enforce stability and invertibility. The best ARMA model is regarded as the global minimum of the non-convex MINLP problem. The robustness and computational performance of the MINLP solvers are compared with brute-force enumeration. Numerical experiments are done for existing time series and one new data set.

  11. Convex polytopes

    CERN Document Server

    Klee, Victor; Ziegler, Günter

    2003-01-01

    "The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to geometers and combinatorialists. The special spirit of the book is very much alive even in those chapters where the book's immense influence made them quickly obsolete. Some other chapters promise beautiful unexplored land for future research. The appearance of the new edition is going to be another moment of grace. Kaibel, Klee and Ziegler were able to update the convex polytope saga in a clear, accurate, lively, and inspired way." (Gil Kalai, The Hebrew University of Jerusalem) "The original book of Grünbaum has provided the central reference for work in this active area of mathematics for the past 35 years...I first consulted this book as a graduate student in 1967; yet, even today, I am surprised again and again by what I find there. It is an amazingly complete reference for work on this subject up to that time and continues to be a major influence on research to this day." (Louis J. Billera, Cornell University) "The or...

  12. A Trust-region-based Sequential Quadratic Programming Algorithm

    DEFF Research Database (Denmark)

    Henriksen, Lars Christian; Poulsen, Niels Kjølstad

    This technical note documents the trust-region-based sequential quadratic programming algorithm used in other works by the authors. The algorithm seeks to minimize a convex nonlinear cost function subject to linear inequalty constraints and nonlinear equality constraints....

  13. Robust Utility Maximization Under Convex Portfolio Constraints

    Energy Technology Data Exchange (ETDEWEB)

    Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)

    2015-04-15

    We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle.

  14. Quadratic choreographies

    CERN Document Server

    Ryckelynck, Philippe

    2011-01-01

    This paper addresses the classical and discrete Euler-Lagrange equations for systems of $n$ particles interacting quadratically in $\\mathbb{R}^d$. By highlighting the role played by the center of mass of the particles, we solve the previous systems via the classical quadratic eigenvalue problem (QEP) and its discrete transcendental generalization. The roots of classical and discrete QEP being given, we state some conditional convergence results. Next, we focus especially on periodic and choreographic solutions and we provide some numerical experiments which confirm the convergence.

  15. Semismooth Newton method for quadratic programs with bound constraints

    Science.gov (United States)

    Daryina, A. N.; Izmailov, A. F.

    2009-10-01

    Convex quadratic programs with bound constraints are proposed to be solved by applying a semismooth Newton method to the corresponding variational inequality. Computational experiments demonstrate that, for strongly convex problems, this approach can be considerably more efficient than more traditional approaches.

  16. A Mix Inexact-Quadratic Fuzzy Water Resources Management Model of Floodplain (IQT-WMMF for Regional Sustainable Development of Dahuangbaowa, China

    Directory of Open Access Journals (Sweden)

    Xueting Zeng

    2015-06-01

    Full Text Available In this study, a mix inexact-quadratic fuzzy water resources management model of floodplain (IQT-WMMF has developed, through incorporating techniques of credibility-constrained programming (CP, two-stage programming (TP, interval-parameter programming (IPP and quadratic programming (QP within a general framework for limited data availability. The IQT-WMMF can provide an effective linkage between system benefit and the associated economic penalty attributed to the violation of the pre-regulated water target under limited data availabilities expressed probabilistic distributions and interval values; meanwhile, imprecise and no-linear economic data would be resolved. The developed method is applied to a real case of planning water resources in the Dahuangbaowa floodplain, China, with the aim to develop a sustainable water resources management in the study region. A number of scenarios with wet land expansion strategies under various credibility levels are analyzed, implying that different policies can lead to varied water-allocation patterns, system benefits, and system-failure risks. The results discover that water deficits and flood damages have brought negative effects on economic development synchronously, which need to effective plans to reduce losses of shortages and floods for achieving higher system benefits. Tradeoffs between economic benefit and system-failure risk can support generating an increased robustness in risk control for water resources allocation under uncertainties, which is beneficial to adjust the current water-allocation sustainably.

  17. Immunizing Conic Quadratic Optimization Problems Against Implementation Errors

    NARCIS (Netherlands)

    Ben-Tal, A.; den Hertog, D.

    2011-01-01

    We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints. To prove this result we first derive a sharper result for the S-lemma in case the two matrices involved can be simultaneously diagonali

  18. Mixed Evolution Strategies for Solving Quadratic Assignment Problems%求解二次指派问题的混合演化策略

    Institute of Scientific and Technical Information of China (English)

    彭宏; 梁文静; 欧永斌

    2000-01-01

    In this paper, we construct some mixed evolution strategies (MES) for solving quadratic assignment problems. The main advantages of the method are the optimum effects, the computational efficiency, and the generality. The efficiency of the method is testified by the simulated results. It can be applied to the solution of combinatorial optimization problems.%本文给出了一种求解二次指派问题的混合演化策略.该方法的主要优点是优化效果好, 运算量小, 通用性强.模拟计算的结果, 验证了该方法的有效性, 它可用于求解其它组合优化问题.

  19. Quadratically constrained quadratic programs on acyclic graphs with application to power flow

    CERN Document Server

    Bose, Subhonmesh; Low, Steven H; Chandy, K Mani

    2012-01-01

    This paper proves that non-convex quadratically constrained quadratic programs have an exact semidefinite relaxation when their underlying graph is acyclic, provided the constraint set satisfies a certain technical condition. When the condition is not satisfied, we propose a heuristic to obtain a feasible point starting from a solution of the relaxed problem. These methods are then demonstrated to provide exact solutions to a richer class of optimal power flow problems than previously solved.

  20. Longitudinal mathematics development of students with learning disabilities and students without disabilities: a comparison of linear, quadratic, and piecewise linear mixed effects models.

    Science.gov (United States)

    Kohli, Nidhi; Sullivan, Amanda L; Sadeh, Shanna; Zopluoglu, Cengiz

    2015-04-01

    Effective instructional planning and intervening rely heavily on accurate understanding of students' growth, but relatively few researchers have examined mathematics achievement trajectories, particularly for students with special needs. We applied linear, quadratic, and piecewise linear mixed-effects models to identify the best-fitting model for mathematics development over elementary and middle school and to ascertain differences in growth trajectories of children with learning disabilities relative to their typically developing peers. The analytic sample of 2150 students was drawn from the Early Childhood Longitudinal Study - Kindergarten Cohort, a nationally representative sample of United States children who entered kindergarten in 1998. We first modeled students' mathematics growth via multiple mixed-effects models to determine the best fitting model of 9-year growth and then compared the trajectories of students with and without learning disabilities. Results indicate that the piecewise linear mixed-effects model captured best the functional form of students' mathematics trajectories. In addition, there were substantial achievement gaps between students with learning disabilities and students with no disabilities, and their trajectories differed such that students without disabilities progressed at a higher rate than their peers who had learning disabilities. The results underscore the need for further research to understand how to appropriately model students' mathematics trajectories and the need for attention to mathematics achievement gaps in policy. Copyright © 2015 Society for the Study of School Psychology. Published by Elsevier Ltd. All rights reserved.

  1. Convex preserving scattered data interpolation using bivariate C1 cubic splines

    Science.gov (United States)

    Lai, Ming-Jun

    2000-07-01

    We use bivariate C1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and sufficient condition on Bernstein-Bézier polynomials, we set the convexity-preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on the data. That is, under certain conditions on the data, there always exists a convexity preservation C1 cubic spline interpolation if the triangulation is refined sufficiently many times. We then replace the quadratical constrains by three linear constrains and formulate the problem into linearly constraint quadratic programming problems in order to be able to solve it easily. Certainly, the existence of convexity preserving interpolatory surfaces is equivalent to the feasibility of the linear constrains. We present a numerical experiment to test which of these three linear constraints performs the best.

  2. Uniformly convex and strictly convex Orlicz spaces

    Science.gov (United States)

    Masta, Al Azhary

    2016-02-01

    In this paper we define the new norm of Orlicz spaces on ℝn through a multiplication operator on an old Orlicz spaces. We obtain some necessary and sufficient conditions that the new norm to be a uniformly convex and strictly convex spaces.

  3. 使用自正则度量的凸二次规划的原始对偶内点法的多项式复杂性%Polynomial Complexity of Primal-dual Interior-point Methods for Convex Quadratic Programming with Self-regular Proximity

    Institute of Scientific and Technical Information of China (English)

    刘中意

    2009-01-01

    最近Peng等人使用新的搜索方向和自正则度量为求解线性规划问题提出了一个原始对偶内点法.本文将这个长步法延伸到凸二次规划.在线性规划情形时,原始空间和对偶空间中的尺度Newton方向是正交的,而在二次规划情形时这是不成立的.本文将处理这个问题并且证明多项式复杂性,并且得到复杂性的上界为O(n√log n log (n/ε)).%Recently Peng et al. have proposed a primal-dual interiorpoint method with new search directions and self-regular proximity for LP.We extend this large-update method to convex quadratic programming (QP).In the case of LP,the scaled Newton directions in the primal and dual spaces are orthogonal.Note that this is not true in the case of QP.In this paper we deal with the problem and polynomial complexity is proved,and the iteration bound is O(√nlog n log (n/ε)).

  4. On convex relaxation of graph isomorphism.

    Science.gov (United States)

    Aflalo, Yonathan; Bronstein, Alexander; Kimmel, Ron

    2015-03-10

    We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving n2 equality and n2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic.

  5. Gradient of the Value Function in Parametric Convex Optimization Problems

    OpenAIRE

    Baotić, Mato

    2016-01-01

    We investigate the computation of the gradient of the value function in parametric convex optimization problems. We derive general expression for the gradient of the value function in terms of the cost function, constraints and Lagrange multipliers. In particular, we show that for the strictly convex parametric quadratic program the value function is continuously differentiable at every point in the interior of feasible space for which the Linear Independent Constraint Qualification holds.

  6. A study of the kinetics and the effect of trace elements on mixed anaerobic fermentative biogas production by ternary quadratic general rotary unitized design

    Directory of Open Access Journals (Sweden)

    Chenxiao Zhang

    2016-01-01

    Full Text Available In this study the effect of trace elements on methanogenesis was investigated during mixed anaerobic fermentation using a single-factor experiment in the present study. The most effective concentrations of Fe0, Fe2+, Co2+ and Ni2+ that were added were 1500, 250, 0.3 and 0.6 mg/L, respectively. The optimal trace element combination was 0.58 mg/L Ni2+, 1200 mg/L Fe0 and 0.34 mg/L Co2+ by the ternary quadratic general rotary unitized design method. The degree of influence exerted by trace elements on the cumulative methane yields decreased in the order of Ni2+, Fe0 and Co2+, and the maximum CH4 yield was 241.6 mL/g volatile solids (VS, according to a regression equation. The non-dissolved organic carbon hydrolytic process showed a good fit with the first-order kinetic model. The maximum value of CH4 was 312.87 mL/g VS. Compared to the control, the bioconversion efficiencies of CH4 and CO2 production increased by 36.76% and 74.50%, respectively, at the optimal trace element combination. The obtained results provide new knowledge for improvements in the efficiency of anaerobic fermentation biogas production.

  7. QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.

    Science.gov (United States)

    Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

    2014-01-01

    We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

  8. Convex analysis and global optimization

    CERN Document Server

    Tuy, Hoang

    2016-01-01

    This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;

    quadratic programming...

  9. Bornological Locally Convex Cones

    Directory of Open Access Journals (Sweden)

    Davood Ayaseh

    2014-10-01

    Full Text Available In this paper we define bornological and b-bornological cones and investigate their properties. We give some characterization for these cones. In the special case of locally convex topological vector space both these concepts reduce to the known concept  of bornological spaces. We introduce and investigate the  convex quasiuniform   structures U_{tau}, U_{sigma}(P,P* and \\U_{beta}(P,P* on locally convex cone (P,U.

  10. Impurity solitons with quadratic nonlinearities

    DEFF Research Database (Denmark)

    Clausen, Carl A. Balslev; Torres, Juan P-; Torner, Lluis

    1998-01-01

    We fmd families of solitary waves mediated by parametric mixing in quadratic nonlinear media that are localized at point-defect impurities. Solitons localized at attractive impurities are found to be dynamically stable. It is shown that localization at the impurity modifies strongly the soliton p...

  11. Uniformly Convex Metric Spaces

    OpenAIRE

    Kell Martin

    2014-01-01

    In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented and a weak topology of such spaces is analyzed. This topology called co-convex topology agrees with the usualy weak topology in Banach spaces. An example of a $CAT(0)$-spaces with weak topology which is not Hausdorff is given. This answers questions raised b...

  12. Theory of convex structures

    CERN Document Server

    van de Vel, MLJ

    1993-01-01

    Presented in this monograph is the current state-of-the-art in the theory of convex structures. The notion of convexity covered here is considerably broader than the classic one; specifically, it is not restricted to the context of vector spaces. Classical concepts of order-convex sets (Birkhoff) and of geodesically convex sets (Menger) are directly inspired by intuition; they go back to the first half of this century. An axiomatic approach started to develop in the early Fifties. The author became attracted to it in the mid-Seventies, resulting in the present volume, in which graphs appear si

  13. Solvable quadratic Lie algebras

    Institute of Scientific and Technical Information of China (English)

    ZHU; Linsheng

    2006-01-01

    A Lie algebra endowed with a nondegenerate, symmetric, invariant bilinear form is called a quadratic Lie algebra. In this paper, the author investigates the structure of solvable quadratic Lie algebras, in particular, the solvable quadratic Lie algebras whose Cartan subalgebras consist of semi-simple elements, the author presents a procedure to construct a class of quadratic Lie algebras from the point of view of cohomology and shows that all solvable quadratic Lie algebras can be obtained in this way.

  14. A Tight Linearization Strategy for Zero-One Quadratic Programming Problems

    CERN Document Server

    gharibi, Wajeb

    2012-01-01

    In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great role in deducing small linearization. Further tight strategies are also discussed.

  15. On convexity in complex networks

    CERN Document Server

    Marc, Tilen

    2016-01-01

    Metric graph properties lie in the heart of the analysis of complex networks, while in this paper we study their convexity. We analyze the expansion of convex subsets of nodes in empirical networks and also convexity of small subgraphs known as graphlets. We demonstrate that convexity is an inherent property of complex networks not present in a random graph. According to our perception of convexity, a convex network is such in which every connected subset of nodes induces a convex subgraph. Especially convex are technological networks and social collaboration graphs, whereas food webs are the only networks studied that are truly non-convex. Many other networks can be divided into a non-convex core surrounded by a convex periphery. We interpret convexity in terms of redundancy of shortest paths in a network and discuss possible applications.

  16. A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

    DEFF Research Database (Denmark)

    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.

    1999-01-01

    The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems. The u....... The unique path generated by the minimizers of these problems yields the solution to the original problem for finite values of the approximation parameter. Thus, a finite continuation algorithm is designed. Results of extensive computational experiments are reported....

  17. Solving quadratic programming problems by delayed projection neural network.

    Science.gov (United States)

    Yang, Yongqing; Cao, Jinde

    2006-11-01

    In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network.

  18. Dynamic Planar Convex Hull

    DEFF Research Database (Denmark)

    Jacob, Riko

    We determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure...... is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects the convex hull......, and the tangent queries to determine whether a given point is inside the convex hull. The space usage of the data structure is O(n). We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....

  19. Dynamic Planar Convex Hull

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølfting; Jacob, Rico

    2002-01-01

    In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage...... of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent queries through a given point, and queries for the neighboring points on the convex hull in O(log n) time. The extreme point queries can be used to decide whether or not a given line intersects...... the convex hull, and the tangent queries to determine whether a given point is inside the convex hull. We give a lower bound on the amortized asymptotic time complexity that matches the performance of this data structure....

  20. Convex Model of Distribution System Reconfiguration%配电网重构的凸模型

    Institute of Scientific and Technical Information of China (English)

    荣德生; 胡举爽

    2016-01-01

    推导出了配电网重构的混合整数二次规划模型、二次规划二次约束模型和二阶锥规划模型,并提出有连续凸松弛的AC潮流问题。所提各模型可由标准商业软件可靠、有效地解决最优性问题。在推导各模型的过程中,得到了放射性网络潮流的近似原始二次约束模型和二阶锥规划模型。%Three models of new mixed-integer quadratic, quadratically constrained and second-order cone program-ming of distribution system reconfiguration are derived, and the AC problem about convex, continuous relaxations is pro-posed. Each model optimality can be solved reliably and efficiently by standard commercial software. In the course of de-riving for each model, the original quadratically constrained and second-order cone approximations model are obtained, to power flow in radial networks.

  1. Statistical properties of convex clustering

    OpenAIRE

    Tan, Kean Ming; Witten, Daniela

    2015-01-01

    In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and $k$-means clustering. In addition, we derive the range of the tuning parameter for convex clustering that yields a non-trivial solution. We also provide an unbiased estimator of the degrees of freedom, and provide a finite sample bound for the prediction error for convex clustering. We compare convex clustering to so...

  2. A discrete-time Lagrangian network for solving constrained quadratic programs.

    Science.gov (United States)

    Tang, W S; Wang, J

    2000-08-01

    A discrete-time recurrent neural network which is called the discrete-time Lagrangian network is proposed in this letter for solving convex quadratic programs. It is developed based on the classical Lagrange optimization method and solves quadratic programs without using any penalty parameter. The condition for the neural network to globally converge to the optimal solution of the quadratic program is given. Simulation results are presented to illustrate its performance.

  3. Gain Scheduling Control of Gas Turbine Engines: Stability by Computing a Single Quadratic Lyapunov Function

    Science.gov (United States)

    2013-06-01

    STABILITY BY COMPUTING A SINGLE QUADRATIC LYAPUNOV FUNCTION Mehrdad Pakmehr∗ PhD Candidate Decision and Control Laboratory (DCL) School of Aerospace...linearization and linear matrix inequality (LMI) techniques. Using convex optimization tools, a single quadratic Lyapunov function is computed for multiple...Scheduling Control of Gas Turbine Engines: Stability by Computing a Single Quadratic Lyapunov Function 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c

  4. Nonparametric Least Squares Estimation of a Multivariate Convex Regression Function

    CERN Document Server

    Seijo, Emilio

    2010-01-01

    This paper deals with the consistency of the least squares estimator of a convex regression function when the predictor is multidimensional. We characterize and discuss the computation of such an estimator via the solution of certain quadratic and linear programs. Mild sufficient conditions for the consistency of this estimator and its subdifferentials in fixed and stochastic design regression settings are provided. We also consider a regression function which is known to be convex and componentwise nonincreasing and discuss the characterization, computation and consistency of its least squares estimator.

  5. Notions of convexity

    CERN Document Server

    Hörmander, Lars

    1994-01-01

    The first two chapters of this book are devoted to convexity in the classical sense, for functions of one and several real variables respectively. This gives a background for the study in the following chapters of related notions which occur in the theory of linear partial differential equations and complex analysis such as (pluri-)subharmonic functions, pseudoconvex sets, and sets which are convex for supports or singular supports with respect to a differential operator. In addition, the convexity conditions which are relevant for local or global existence of holomorphic differential equations are discussed, leading up to Trépreau’s theorem on sufficiency of condition (capital Greek letter Psi) for microlocal solvability in the analytic category. At the beginning of the book, no prerequisites are assumed beyond calculus and linear algebra. Later on, basic facts from distribution theory and functional analysis are needed. In a few places, a more extensive background in differential geometry or pseudodiffer...

  6. Convex Geometry and Stoichiometry

    CERN Document Server

    Jer-Chin,

    2011-01-01

    We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of "mixtures" to explain multiple stoichiometry, and the half-reaction for balancing redox actions all yield nice convex geometric interpretations. We also relate some natural questions on reaction mechanisms with the enumeration of lattice points in polytopes. Lastly, it is known that a given reaction mechanism imposes linear constraints on observed stoichiometries. We consider the inverse question of deducing reaction mechanism consistent with a given set of linear stoichiometric restrictions.

  7. The quadratic Fock functor

    CERN Document Server

    Accardi, Luigi

    2009-01-01

    We construct the quadratic analogue of the boson Fock functor. While in the first order case all contractions on the 1--particle space can be second quantized, the semigroup of contractions that admit a quadratic second quantization is much smaller due to the nonlinearity. Within this semigroup we characterize the unitary and the isometric elements.

  8. Quadratic eigenvalue problems.

    Energy Technology Data Exchange (ETDEWEB)

    Walsh, Timothy Francis; Day, David Minot

    2007-04-01

    In this report we will describe some nonlinear eigenvalue problems that arise in the areas of solid mechanics, acoustics, and coupled structural acoustics. We will focus mostly on quadratic eigenvalue problems, which are a special case of nonlinear eigenvalue problems. Algorithms for solving the quadratic eigenvalue problem will be presented, along with some example calculations.

  9. Global approximation of convex functions

    CERN Document Server

    Azagra, D

    2011-01-01

    We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.

  10. Egalitarianism in Convex Fuzzy Games

    NARCIS (Netherlands)

    Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.

    2002-01-01

    In this paper the egalitarian solution for convex cooperative fuzzy games is introduced.The classical Dutta-Ray algorithm for finding the constrained egalitarian solution for convex crisp games is adjusted to provide the egalitarian solution of a convex fuzzy game.This adjusted algorithm is also a f

  11. Average Convexity in Communication Situations

    NARCIS (Netherlands)

    Slikker, M.

    1998-01-01

    In this paper we study inheritance properties of average convexity in communication situations. We show that the underlying graph ensures that the graphrestricted game originating from an average convex game is average convex if and only if every subgraph associated with a component of the underlyin

  12. Efficient Approximation of Convex Recolorings

    OpenAIRE

    Moran, Shlomo; Snir, Sagi

    2005-01-01

    A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arise in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a convex coloring of the tree. Research on perfect phylogeny is usually focused on finding a tree so t...

  13. Reduction of shock induced noise in imperfectly expanded supersonic jets using convex optimization

    Science.gov (United States)

    Adhikari, Sam

    2007-11-01

    Imperfectly expanded jets generate screech noise. The imbalance between the backpressure and the exit pressure of the imperfectly expanded jets produce shock cells and expansion or compression waves from the nozzle. The instability waves and the shock cells interact to generate the screech sound. The mathematical model consists of cylindrical coordinate based full Navier-Stokes equations and large-eddy-simulation turbulence modeling. Analytical and computational analysis of the three-dimensional helical effects provide a model that relates several parameters with shock cell patterns, screech frequency and distribution of shock generation locations. Convex optimization techniques minimize the shock cell patterns and the instability waves. The objective functions are (convex) quadratic and the constraint functions are affine. In the quadratic optimization programs, minimization of the quadratic functions over a set of polyhedrons provides the optimal result. Various industry standard methods like regression analysis, distance between polyhedra, bounding variance, Markowitz optimization, and second order cone programming is used for Quadratic Optimization.

  14. Quadratic Serendipity Finite Elements on Polygons Using Generalized Barycentric Coordinates

    CERN Document Server

    Rand, Alexander; Bajaj, Chandrajit

    2011-01-01

    We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n+1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called `serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

  15. Convex bodies of states and maps

    Science.gov (United States)

    Grabowski, Janusz; Ibort, Alberto; Kuś, Marek; Marmo, Giuseppe

    2013-10-01

    We give a general solution to the question of when the convex hulls of orbits of quantum states on a finite-dimensional Hilbert space under unitary actions of a compact group have a non-empty interior in the surrounding space of all density operators. The same approach can be applied to study convex combinations of quantum channels. The importance of both problems stems from the fact that, usually, only sets with non-vanishing volumes in the embedding spaces of all states or channels are of practical importance. For the group of local transformations on a bipartite system we characterize maximally entangled states by the properties of a convex hull of orbits through them. We also compare two partial characteristics of convex bodies in terms of the largest balls and maximum volume ellipsoids contained in them and show that, in general, they do not coincide. Separable states, mixed-unitary channels and k-entangled states are also considered as examples of our techniques.

  16. A quadratic rate of asymptotic regularity for CAT(0)-spaces

    OpenAIRE

    Leustean, Laurentiu

    2005-01-01

    In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the Krasnoselski-Mann iterations of nonexpansive mappings in CAT(0)-spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hyperbolic spaces a quantitative version of a strengthening of Groetsch's theorem obtained by Kohlenbach using methods from mathematical logic (so-called ``proof mining'').

  17. A parameter-dependent refinement of the discrete Jensen's inequality for convex and mid-convex functions

    Directory of Open Access Journals (Sweden)

    Horváth László

    2011-01-01

    Full Text Available Abstract In this paper, a new parameter-dependent refinement of the discrete Jensen's inequality is given for convex and mid-convex functions. The convergence of the introduced sequences is also studied. One of the proofs requires an interesting convergence theorem with probability theoretical background. We apply the results to define some new quasi-arithmetic and mixed symmetric means and study their monotonicity and convergence.

  18. Introducing the Adaptive Convex Enveloping

    CERN Document Server

    Yu, Sheng

    2011-01-01

    Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an accurate, fast and reliable algorithm for solving convex dynamic programs with multivariate continuous states and actions, called Adaptive Convex Enveloping. This is a short introduction of the core technique created and used in my dissertation, so it is less formal, and misses some parts, such as literature review and reference, compared to a full journal paper.

  19. Convex polytopes and quantum states

    Energy Technology Data Exchange (ETDEWEB)

    Wilmott, Colin; Kampermann, Hermann; Bruss, Dagmar [Institut fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf (Germany)

    2010-07-01

    A convex polytope is defined as the convex hull of a finite non-empty set of vectors. We present a theorem of Rado (1952) which characterizes the convex hull of the collection of all permutations of a given real d-tuple in terms of the Hardy-Littlewood-Polya spectral order relation prec. We give a necessary and sufficient condition to construct a d-dimensional convex polytope which utilizes Rado's original (d-1)-dimensional characterization, and we describe how the resulting polytope may be placed in a quantum mechanical framework.

  20. The H2 Control Problem for Quadratically Invariant Systems with Delays

    OpenAIRE

    Lamperski, Andrew; Doyle, John C.

    2013-01-01

    This paper gives a new solution to the output feedback H2 problem for quadratically invariant communication delay patterns. A characterization of all stabilizing controllers satisfying the delay constraints is given and the decentralized H2 problem is cast as a convex model matching problem. The main result shows that the model matching problem can be reduced to a finite-dimensional quadratic program. A recursive state-space method for computing the optimal controller based on vectorization i...

  1. Indirect quantum tomography of quadratic Hamiltonians

    Energy Technology Data Exchange (ETDEWEB)

    Burgarth, Daniel [Institute for Mathematical Sciences, Imperial College London, London SW7 2PG (United Kingdom); Maruyama, Koji; Nori, Franco, E-mail: daniel@burgarth.de, E-mail: kmaruyama@riken.jp [Advanced Science Institute, RIKEN, Wako-shi, Saitama 351-0198 (Japan)

    2011-01-15

    A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few resources. We found that almost all the properties of the Hamiltonian are determined by its surface and that these properties can be measured even if the system can only be initialized to a mixed state. Therefore, our method can be applied to various physical models, with important examples including coupled nano-mechanical oscillators, hopping fermions in optical lattices and transverse Ising chains.

  2. A Convex Variational Model for Restoring Blurred Images with Multiplicative Noise

    DEFF Research Database (Denmark)

    Dong, Yiqiu; Tieyong Zeng

    2013-01-01

    In this paper, a new variational model for restoring blurred images with multiplicative noise is proposed. Based on the statistical property of the noise, a quadratic penalty function technique is utilized in order to obtain a strictly convex model under a mild condition, which guarantees...... to multiplicative noise. A comparison with other methods is provided as well....

  3. Convex Games versus Clan Games

    NARCIS (Netherlands)

    Brânzei, R.; Dimitrov, D.A.; Tijs, S.H.

    2006-01-01

    In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games.We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games.Furthermore, each monotonic

  4. On Quadratic Differential Forms

    NARCIS (Netherlands)

    Willems, J.C.; Trentelman, H.L.

    1998-01-01

    This paper develops a theory around the notion of quadratic differential forms in the context of linear differential systems. In many applications, we need to not only understand the behavior of the system variables but also the behavior of certain functionals of these variables. The obvious cases w

  5. Aspects of Quadratic Gravity

    CERN Document Server

    Alvarez-Gaume, Luis; Kounnas, Costas; Lust, Dieter; Riotto, Antonio

    2016-01-01

    We discuss quadratic gravity where terms quadratic in the curvature tensor are included in the action. After reviewing the corresponding field equations, we analyze in detail the physical propagating modes in some specific backgrounds. First we confirm that the pure $R^2$ theory is indeed ghost free. Then we point out that for flat backgrounds the pure $R^2$ theory propagates only a scalar massless mode and no spin-two tensor mode. However, the latter emerges either by expanding the theory around curved backgrounds like de Sitter or anti-de Sitter, or by changing the long-distance dynamics by introducing the standard Einstein term. In both cases, the theory is modified in the infrared and a propagating graviton is recovered. Hence we recognize a subtle interplay between the UV and IR properties of higher order gravity. We also calculate the corresponding Newton's law for general quadratic curvature theories. Finally, we discuss how quadratic actions may be obtained from a fundamental theory like string- or M-...

  6. Convex Optimization without Projection Steps

    CERN Document Server

    Jaggi, Martin

    2011-01-01

    We study the general problem of minimizing a convex function over a compact convex domain. We will investigate a simple iterative approximation algorithm that does not need projection steps in order to stay inside the optimization domain. Instead of a projection step, the linearized problem defined by a current subgradient is solved, which gives a step direction that will naturally stay in the domain. The approach generalizes the sparse greedy algorithm of Clarkson (and the low-rank SDP solver by Hazan) to arbitrary convex domains, and to using subgradients for the case of non-differentiable convex functions. Analogously, we give a convergence proof guaranteeing {\\epsilon}-small duality gap after O(1/{\\epsilon}) iterations. The framework allows us understand the sparsity of approximate solutions for any l1-regularized convex optimization problem, expressed as a function of the approximation quality. We obtain matching upper and lower bounds of {\\Theta}(1/{\\epsilon}) for the sparsity for l1-problems. The same ...

  7. Low-rank quadratic semidefinite programming

    KAUST Repository

    Yuan, Ganzhao

    2013-04-01

    Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.

  8. A SPLITTING METHOD FOR QUADRATIC PROGRAMMING PROBLEM

    Institute of Scientific and Technical Information of China (English)

    魏紫銮

    2001-01-01

    A matrix splitting method is presented for minimizing a quadratic programming (QP)problem, and a general algorithm is designed to solve the QP problem and generates a sequence of iterative points. We prove that the sequence generated by the algorithm converges to the optimal solution and has an R-linear rate of convergence if the QP problem is strictly convex and nondegenerate, and that every accumulation point of the sequence generated by the general algorithm is a KKT point of the original problem under the hypothesis that the value of the objective function is bounded below on the constrained region, and that the sequence converges to a KKT point if the problem is nondegenerate and the constrained region is bounded.

  9. Extreme properties of quermassintegrals of convex bodies

    Institute of Scientific and Technical Information of China (English)

    LENG; Gangsong

    2001-01-01

    [1]Ball,K.,Shadows of convex bodies,Trans.Amer.Math.Soc.,1991,327:891-901.[2]Lutwak,E.,Mixed projection inequalities,Trans.Amer.Math.Soc.,1985,287:92-106.[3]Bourgain,J.,Lindenstrauss,J.,Projection bodies,Israel Seminar (G.A.F.A) 1986-1987,Lecture Notes in Math.Vol.1317,Berlin-New York:Springer-Verlag,1988,250-269.[4]Chakerian,G.D.,Lutwak,E.,Bodies with similar projections,Trans.Amer.Math.Soc.,1997,349:1811-1820.[5]Schneider,R.,Weil,W.,Zonoids and related topics,Convexity and its Applications (eds.Gruber,P.M.,Wills,J.M.),Basel:Birkhuser,1983,296-316.[6]Schneider,R.,Convex Bodies:the Brunn-Minkowski Theory,Cambridge:Cambridge University Press,1993.[7]Schneider,R.,On the determination of convex bodies by projection and girth functions,Result Math.,1998,33:155-160.[8]Thompson,A.C.,Minkowski Geometry,Cambridge:Cambridge University Press,1996.[9]Petty,C.M.,Projection bodies,in Proceedings,Coll Convexity,Copenhagen,1965,Kbenhavns Univ.Mat.Inst.,1967,234-241.[10]Schneider,R.,Zu einem problem von Shephard über die projectionen konvexer kirper,Math.Z.,1967,101:71-81.[11]Ball,K.,Volume ratios and a reverse isoprimetric inequalitity,J.London Math.Soc.,1991,44(2):351-359.[12]Gardner,R.J.,Intersection bodies and the Busemann-Petty problem,Trans.Amer.Math.Soc.,1994,342:435-445.[13]Gardner,R.J.,A positive answer to the Busemann-petty problem in three dimensions,Annals of Math.,1994,140:435-447.[14]Grinberg,E.L.,Isoperimetric inequalities and identities fork-dimensional cross-sections of convex bodies,Math.Ann.,1991,291:75-86.[15]Goodey,P.,Schneider,R.,Weil,W.,On the determination of convex bodies by projection functions,Bull.London Math.Soc.,1997,29:82-88.[16]Lutwak,E.,Intersection bodies and dual mixed volumes,Adv.Math.,1988,71:232-261.[17]Zhang,G.,Centered bodies and dual mixed volumes,Trans.Amer.Soc.,1994,345:777-801.[18]Zhang,G.,Dual Kinematic formulas,Trans.Amer.Soc.,1999,351:985-995.[19

  10. Extended gcd of quadratic integers

    CERN Document Server

    Miled, Abdelwaheb

    2010-01-01

    Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.

  11. A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives

    NARCIS (Netherlands)

    de Klerk, E.; Sotirov, R.; Truetsch, U.

    2015-01-01

    Recent progress in solving quadratic assignment problems (QAPs) from the QAPLIB (Quadratic Assignment Problem Library) test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite programming (SDP) bounds for QAPs have also

  12. Scalable Effective Approaches for Quadratic Assignment Problems Based on Conic Optimization and Applications

    Science.gov (United States)

    2012-02-09

    several optimization models and algorithm design for problems from computer vision and learning , research on sparse solutions in quadratic optimization...following papers: [9] L. Mukherjee, V. Singh, J. Peng and C. Hinrichs. Learning kernels for variants of normalized cuts: Convex relaxations and...are very small gaps compared to state-of-the-art knowledge in comunications . Table 1. Bounds for adjacency matrix

  13. Entanglement Quantification Made Easy: Polynomial Measures Invariant under Convex Decomposition.

    Science.gov (United States)

    Regula, Bartosz; Adesso, Gerardo

    2016-02-19

    Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.

  14. Optimal convex correcting procedures in problems of high dimension

    Science.gov (United States)

    Dokukin, A. A.; Senko, O. V.

    2011-09-01

    The properties of convex correcting procedures (CCPs) over sets of predictors are examined. It is shown that the minimization of the generalized error in a CCP is reduced to a quadratic programming problem. The conditions are studied under which a set of predictors cannot be reduced without degrading the accuracy of the corresponding optimal CCP. Experimental studies of the prognostic properties of CCPs for samples of one-dimensional linear regressions showed that CCP optimization can be an effective tool for regression variable selection.

  15. Decision Problems For Convex Languages

    CERN Document Server

    Brzozowski, Janusz; Xu, Zhi

    2008-01-01

    In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages''). We show that we can decide whether a given language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but that the problem is PSPACE-hard if L is represented by an NFA. In the case that a regular language is not convex, we prove tight upper bounds on the length of the shortest words demonstrating this fact, in terms of the number of states of an accepting DFA. Similar results are proved for some subclasses of convex languages: the prefix-, suffix-, factor-, and subword-closed languages, and the prefix-, suffix-, factor-, and subword-free languages.

  16. Covering Numbers for Convex Functions

    CERN Document Server

    Guntuboyina, Adityanand

    2012-01-01

    In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\\epsilon$-covering number of $\\C([a, b]^d, B)$, in the $L_p$-metric, $1 \\le p 0$, and $\\C([a,b]^d, B)$ denotes the set of all convex functions on $[a, b]^d$ that are uniformly bounded by $B$. We summarize previously known results on covering numbers for convex functions and also provide alternate proofs of some known results. Our results have direct implications in the study of rates of convergence of empirical minimization procedures as well as optimal convergence rates in the numerous convexity constrained function estimation problems.

  17. Hyperspectral image superresolution: An edge-preserving convex formulation

    CERN Document Server

    Simões, Miguel; Almeida, Luis B; Chanussot, Jocelyn

    2014-01-01

    Hyperspectral remote sensing images (HSIs) are characterized by having a low spatial resolution and a high spectral resolution, whereas multispectral images (MSIs) are characterized by low spectral and high spatial resolutions. These complementary characteristics have stimulated active research in the inference of images with high spatial and spectral resolutions from HSI-MSI pairs. In this paper, we formulate this data fusion problem as the minimization of a convex objective function containing two data-fitting terms and an edge-preserving regularizer. The data-fitting terms are quadratic and account for blur, different spatial resolutions, and additive noise; the regularizer, a form of vector Total Variation, promotes aligned discontinuities across the reconstructed hyperspectral bands. The optimization described above is rather hard, owing to its non-diagonalizable linear operators, to the non-quadratic and non-smooth nature of the regularizer, and to the very large size of the image to be inferred. We tac...

  18. Complex Convexity of Orlicz Modular Sequence Spaces

    Directory of Open Access Journals (Sweden)

    Lili Chen

    2016-01-01

    Full Text Available The concepts of complex extreme points, complex strongly extreme points, complex strict convexity, and complex midpoint locally uniform convexity in general modular spaces are introduced. Then we prove that, for any Orlicz modular sequence space lΦ,ρ, lΦ,ρ is complex midpoint locally uniformly convex. As a corollary, lΦ,ρ is also complex strictly convex.

  19. Uniformly convex-transitive function spaces

    OpenAIRE

    Rambla-Barreno, Fernando; Talponen, Jarno

    2009-01-01

    We introduce a property of Banach spaces called uniform convex-transitivity, which falls between almost transitivity and convex-transitivity. We will provide examples of uniformly convex-transitive spaces. This property behaves nicely in connection with some Banach-valued function spaces. As a consequence, we obtain new examples of convex-transitive Banach spaces.

  20. On Fuzzy Simplex and Fuzzy Convex Hull

    Institute of Scientific and Technical Information of China (English)

    Dong QIU; Wei Quan ZHANG

    2011-01-01

    In this paper,we discuss fuzzy simplex and fuzzy convex hull,and give several representation theorems for fuzzy simplex and fuzzy convex hull.In addition,by giving a new characterization theorem of fuzzy convex hull,we improve some known results about fuzzy convex hull.

  1. The Convex Coordinates of the Symmedian Point

    Science.gov (United States)

    Boyd, J. N.; Raychowdhury, P. N.

    2006-01-01

    In this note, we recall the convex (or barycentric) coordinates of the points of a closed triangular region. We relate the convex and trilinear coordinates of the interior points of the triangular region. We use the relationship between convex and trilinear coordinates to calculate the convex coordinates of the symmedian point of the triangular…

  2. Convexity Adjustments for ATS Models

    DEFF Research Database (Denmark)

    Murgoci, Agatha; Gaspar, Raquel M.

    Practitioners are used to value a broad class of exotic interest rate derivatives simply by preforming for what is known as convexity adjustments (or convexity corrections). We start by exploiting the relations between various interest rate models and their connections to measure changes. As a re......Practitioners are used to value a broad class of exotic interest rate derivatives simply by preforming for what is known as convexity adjustments (or convexity corrections). We start by exploiting the relations between various interest rate models and their connections to measure changes....... As a result we classify convexity adjustments into forward adjustments and swaps adjustments. We, then, focus on affine term structure (ATS) models and, in this context, conjecture convexity adjustments should be related of affine functionals. In the case of forward adjustments, we show how to obtain exact...... formulas. Concretely for LIBOR in arrears (LIA) contracts, we derive the system of Riccatti ODE-s one needs to compute to obtain the exact adjustment. Based upon the ideas of Schrager and Pelsser (2006) we are also able to derive general swap adjustments useful, in particular, when dealing with constant...

  3. Compactly convex sets in linear topological spaces

    CERN Document Server

    Banakh, T; Ravsky, O

    2012-01-01

    A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\\Phi:X\\to exp(X)$ such that $[x,y]\\subset\\Phi(x)\\cup \\Phi(y)$ for all $x,y\\in X$. We prove that each convex subset of the plane is compactly convex. On the other hand, the space $R^3$ contains a convex set that is not compactly convex. Each compactly convex subset $X$ of a linear topological space $L$ has locally compact closure $\\bar X$ which is metrizable if and only if each compact subset of $X$ is metrizable.

  4. Quadratic 0-1 programming: Geometric methods and duality analysis

    Science.gov (United States)

    Liu, Chunli

    The unconstraint quadratic binary problem (UBQP), as a classical combinatorial problem, finds wide applications in broad field and human activities including engineering, science, finance, etc. The NP-hardness of the combinatorial problems makes a great challenge to solve the ( UBQP). The main purpose of this research is to develop high performance solution method for solving (UBQP) via the geometric properties of the objective ellipse contour and the optimal solution. This research makes several contributions to advance the state-of-the-art of geometric approach of (UBQP). These contributions include both theoretical and numerical aspects as stated below. In part I of this dissertation, certain rich geometric properties hidden behind quadratic 0-1 programming are investigated. Especially, we derive new lower bounding methods and variable fixation techniques for quadratic 0-1 optimization problems by investigating geometric features of the ellipse contour of a (perturbed) convex quadratic function. These findings further lead to some new optimality conditions for quadratic 0-1 programming. Integrating these novel solution schemes into a proposed solution algorithm of a branch-and-bound type, we obtain promising preliminary computational results. In part II of this dissertation, we present new results of the duality gap between the binary quadratic optimization problem and its Lagrangian dual. We first derive a necessary and sufficient condition for the zero duality gap and discuss its relationship with the polynomial solvability of the problem. We then characterize the zeroness of duality gap by the distance, delta, between the binary set and certain affine space C. Finally, we discuss a computational procedure of the distance delta. These results provide new insights into the duality gap and polynomial solvability of binary quadratic optimization problems.

  5. Convex relationships in ecosystems containing mixtures of trees and grass

    CSIR Research Space (South Africa)

    Scholes, RJ

    2003-12-01

    Full Text Available The relationship between grass production and the quantity of trees in mixed tree-grass ecosystems (savannas) is convex for all or most of its range. In other words, the grass production declines more steeply per unit increase in tree quantity...

  6. Powers of Convex-Cyclic Operators

    Directory of Open Access Journals (Sweden)

    Fernando León-Saavedra

    2014-01-01

    Full Text Available A bounded operator T on a Banach space X is convex cyclic if there exists a vector x such that the convex hull generated by the orbit Tnxn≥0 is dense in X. In this note we study some questions concerned with convex-cyclic operators. We provide an example of a convex-cyclic operator T such that the power Tn fails to be convex cyclic. Using this result we solve three questions posed by Rezaei (2013.

  7. A class of free locally convex spaces

    Science.gov (United States)

    Sipacheva, O. V.

    2003-04-01

    Stratifiable spaces are a natural generalization of metrizable spaces for which Dugundji's theorem holds. It is proved that the free locally convex space of a stratifiable space is stratifiable. This means, in particular, that the space of finitely supported probability measures on a stratifiable space is a retract of a locally convex space, and that each stratifiable convex subset of a locally convex space is a retract of a locally convex space.

  8. A Neurodynamic Optimization Approach to Bilevel Quadratic Programming.

    Science.gov (United States)

    Qin, Sitian; Le, Xinyi; Wang, Jun

    2016-08-19

    This paper presents a neurodynamic optimization approach to bilevel quadratic programming (BQP). Based on the Karush-Kuhn-Tucker (KKT) theorem, the BQP problem is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). It is proved that the global solution of the MPCC is the minimal one of the optimal solutions to multiple convex optimization subproblems. A recurrent neural network is developed for solving these convex optimization subproblems. From any initial state, the state of the proposed neural network is convergent to an equilibrium point of the neural network, which is just the optimal solution of the convex optimization subproblem. Compared with existing recurrent neural networks for BQP, the proposed neural network is guaranteed for delivering the exact optimal solutions to any convex BQP problems. Moreover, it is proved that the proposed neural network for bilevel linear programming is convergent to an equilibrium point in finite time. Finally, three numerical examples are elaborated to substantiate the efficacy of the proposed approach.

  9. Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation

    CERN Document Server

    Kumar, Akshat

    2012-01-01

    Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation of MAP can be derived from the CCCP perspective. Experiments on synthetic and real-world problems confirm that our new approach is competitive with max-product and its variations. Compared with CPLEX, we achieve more than an order-of-magnitude speedup in solving optimally the convex QP relaxation.

  10. The genealogy of convex solids

    CERN Document Server

    Domokos, Gabor; Szabó, Timea

    2012-01-01

    The shape of homogeneous, smooth convex bodies as described by the Euclidean distance from the center of gravity represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale functions on S^2 by exhausting all combinatorial possibilities: every 2-colored quadrangulation of the sphere is isomorphic to a suitably represented Morse-Smale complex associated with a function in M_C (and vice versa). We prove our claim by an inductive algorithm, starting from the path graph P_2 and generating convex bodies corresponding to quadrangulations with increasing number of vertices by performing each combinatorially possible vertex splitting by a convexity- preserving local manipulation of the surface. Since convex bodies carrying Morse-Smale complexes isomorphic to P_2 exist, this algorithm not only proves our claim but also defines a hierarchical order among convex solids and general- izes the known classification scheme in [35], ...

  11. The -Curvature Images of Convex Bodies and -Projection Bodies

    Indian Academy of Sciences (India)

    Songjun Lv; Gangsong Leng

    2008-08-01

    Associated with the -curvature image defined by Lutwak, some inequalities for extended mixed -affine surface areas of convex bodies and the support functions of -projection bodies are established. As a natural extension of a result due to Lutwak, an -type affine isoperimetric inequality, whose special cases are -Busemann–Petty centroid inequality and -affine projection inequality, respectively, is established. Some -mixed volume inequalities involving -projection bodies are also established.

  12. Characterization of the minimal penalty of a convex risk measure with applications to Levy processes

    CERN Document Server

    Hernández-Hernández, Daniel

    2012-01-01

    The minimality of the penalization function associated with a convex risk measure is analyzed in this paper. First, in a general static framework, we provide necessary and sufficient conditions for a penalty function defined in a convex and closed subset of the absolutely continuous measures with respect to some reference measure $\\mathbb{P}$ to be minimal. When the probability space supports a L\\'{e}vy process, we establish results that guarantee the minimality property of a penalty function described in terms of the coefficients associated with the density processes. The set of densities processes is described and the convergence of its quadratic variation is analyzed.

  13. Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

    OpenAIRE

    Vegh, Laszlo A.

    2011-01-01

    A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective $\\sum_{ij\\in E} C_{ij}(f_{ij})$ over feasible flows $f$, where on every arc $ij$ of the network, $C_{ij}$ is a convex function. We give a strongly polynomial algorithm for the case when all $C_{ij}$'s are convex quadratic functions, settling an open problem raised e.g. by Hochbaum [1994]. We also give strongly polynomial algorithms for computing market equilibria in Fisher markets with linear util...

  14. NP-completeness of weakly convex and convex dominating set decision problems

    Directory of Open Access Journals (Sweden)

    Joanna Raczek

    2004-01-01

    Full Text Available The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \\(NP\\-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.

  15. Local Routing in Convex Subdivisions

    DEFF Research Database (Denmark)

    Bose, Prosenjit; Durocher, Stephane; Mondal, Debajyoti;

    2015-01-01

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted...... classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general classes of geometric graphs (e.g., convex subdivisions or planar subdivisions), previous local geometric routing algorithms required Θ(logn) state bits to be stored and passed with the message. We present...... the first local geometric routing algorithm using only one state bit to guarantee delivery on convex subdivisions and the first local geometric memoryless routing algorithm that guarantees delivery on edge-augmented monotone subdivisions (including all convex subdivisions) when the algorithm has knowledge...

  16. A CLASS OF QUADRATIC HAMILTONIAN SYSTEMS UNDER QUADRATIC PERTURBATION

    Institute of Scientific and Technical Information of China (English)

    丰建文; 陈士华

    2001-01-01

    This paper deals with a class of quadratic Hamiltonian systems with quadratic perturbation. The authors prove that if the first order Melnikov function M1(h) = 0 and the second order Melnikov function M2(h) ≡ 0, then the origin of the Hamiltonian system with small perturbation is a center.

  17. Dose evaluation from multiple detector outputs using convex optimisation.

    Science.gov (United States)

    Hashimoto, Makoto; Iimoto, Takeshi; Kosako, Toshiso

    2011-07-01

    A dose evaluation using multiple radiation detectors can be improved by the convex optimisation method. It enables flexible dose evaluation corresponding to the actual radiation energy spectrum. An application to the neutron ambient dose equivalent evaluation is investigated using a mixed-gas proportional counter. The convex derives the certain neutron ambient dose with certain width corresponding to the true neutron energy spectrum. The range of the evaluated dose is comparable to the error of conventional neutron dose measurement equipments. An application to the neutron individual dose equivalent measurement is also investigated. Convexes of particular dosemeter combinations evaluate the individual dose equivalent better than the dose evaluation of a single dosemeter. The combinations of dosemeters with high orthogonality of their response characteristics tend to provide a good suitability for dose evaluation.

  18. Quadratic solitons as nonlocal solitons

    DEFF Research Database (Denmark)

    Nikolov, Nikola Ivanov; Neshev, D.; Bang, Ole

    2003-01-01

    We show that quadratic solitons are equivalent to solitons of a nonlocal Kerr medium. This provides new physical insight into the properties of quadratic solitons, often believed to be equivalent to solitons of an effective saturable Kerr medium. The nonlocal analogy also allows for analytical...

  19. Path Following in the Exact Penalty Method of Convex Programming.

    Science.gov (United States)

    Zhou, Hua; Lange, Kenneth

    2015-07-01

    Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

  20. Quantum information and convex optimization

    Energy Technology Data Exchange (ETDEWEB)

    Reimpell, Michael

    2008-07-01

    This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)

  1. A Microscopic Convexity Principle for Spacetime Convex Solutions of Fully Nonlinear Parabolic Equations

    Institute of Scientific and Technical Information of China (English)

    Chuan Qiang CHEN; Bo Wen HU

    2013-01-01

    We study microscopic spacetime convexity properties of fully nonlinear parabolic partial differential equations.Under certain general structure condition,we establish a constant rank theorem for the spacetime convex solutions of fully nonlinear parabolic equations.At last,we consider the parabolic convexity of solutions to parabolic equations and the convexity of the spacetime second fundamental form of geometric flows.

  2. Revisiting separation properties of convex fuzzy sets

    Science.gov (United States)

    Separation of convex sets by hyperplanes has been extensively studied on crisp sets. In a seminal paper separability and convexity are investigated, however there is a flaw on the definition of degree of separation. We revisited separation on convex fuzzy sets that have level-wise (crisp) disjointne...

  3. A Note on Permutationally Convex Games

    NARCIS (Netherlands)

    van Velzen, S.; Hamers, H.J.M.; Norde, H.W.

    2005-01-01

    In this paper we generalise marginal vectors and permutational convexity.We show that if a game is generalised permutationally convex, then the corresponding generalised marginal vector is a core element.Furthermore we refine the concept of permutational convexity and show that this refinement yield

  4. On Uniform Convexity of Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    Qing Jin CHENG; Bo WANG; Cui Ling WANG

    2011-01-01

    This paper gives some relations and properties of several kinds of generalized convexity in Banach spaces. As a result, it proves that every kind of uniform convexity implies the Banach-Sakes property, and several notions of uniform convexity in literature are actually equivalent.

  5. Computing farthest neighbors on a convex polytope

    NARCIS (Netherlands)

    Cheong, O.; Shin, C.S.; Vigneron, A.

    2002-01-01

    Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in expecte

  6. Computing farthest neighbors on a convex polytope

    NARCIS (Netherlands)

    Cheong, O.; Shin, C.S.; Vigneron, A.

    2002-01-01

    Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in

  7. Generalized geometrically convex functions and inequalities.

    Science.gov (United States)

    Noor, Muhammad Aslam; Noor, Khalida Inayat; Safdar, Farhat

    2017-01-01

    In this paper, we introduce and study a new class of generalized functions, called generalized geometrically convex functions. We establish several basic inequalities related to generalized geometrically convex functions. We also derive several new inequalities of the Hermite-Hadamard type for generalized geometrically convex functions. Several special cases are discussed, which can be deduced from our main results.

  8. Firey linear combinations of convex bodies

    Institute of Scientific and Technical Information of China (English)

    XIONG Ge; XIAO Qi-ming; CHEUNG Wing-Sum

    2009-01-01

    For convex bodies, the Firey linear combinations were introduced and studied in several papers. In this paper the mean width of the Firey linear combinations of convex bodies is studied, and the lower bound of the mean width of the Firey linear combinations of convex body and its polar body is given.

  9. STRUCTURE OPTIMIZATION OF RESERVATION BY PRECISE QUADRATIC REGULARIZATION

    Directory of Open Access Journals (Sweden)

    KOSOLAP A. I.

    2015-11-01

    Full Text Available The problem of optimization of the structure of systems redundancy elements. Such problems arise in the design of complex systems. To improve the reliability of operation of such systems of its elements are duplicated. This increases system cost and improves its reliability. When optimizing these systems is maximized probability of failure of the entire system while limiting its cost or the cost is minimized for a given probability of failure-free operation. A mathematical model of the problem is a discrete backup multiextremal. To search for the global extremum of currently used methods of Lagrange multipliers, coordinate descent, dynamic programming, random search. These methods guarantee a just and local solutions are used in the backup tasks of small dimension. In the work for solving redundancy uses a new method for accurate quadratic regularization. This method allows you to convert the original discrete problem to the maximization of multi vector norm on a convex set. This means that the diversity of the tasks given to the problem of redundancy maximize vector norm on a convex set. To solve the problem, a reformed straightdual interior point methods. Currently, it is the best method for local optimization of nonlinear problems. Transformed the task includes a new auxiliary variable, which is determined by dichotomy. There have been numerous comparative numerical experiments in problems with the number of redundant subsystems to one hundred. These experiments confirm the effectiveness of the method of precise quadratic regularization for solving problems of redundancy.

  10. A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Based on a differentiable merit function proposed by Taji,et al in "Mathematical Programming,1993,58: 369-383",a projected gradient trust region method for the monotone variational inequality problem with convex constraints is presented.Theoretical analysis is given which proves that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions.The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.

  11. A high-performance feedback neural network for solving convex nonlinear programming problems.

    Science.gov (United States)

    Leung, Yee; Chen, Kai-Zhou; Gao, Xing-Bao

    2003-01-01

    Based on a new idea of successive approximation, this paper proposes a high-performance feedback neural network model for solving convex nonlinear programming problems. Differing from existing neural network optimization models, no dual variables, penalty parameters, or Lagrange multipliers are involved in the proposed network. It has the least number of state variables and is very simple in structure. In particular, the proposed network has better asymptotic stability. For an arbitrarily given initial point, the trajectory of the network converges to an optimal solution of the convex nonlinear programming problem under no more than the standard assumptions. In addition, the network can also solve linear programming and convex quadratic programming problems, and the new idea of a feedback network may be used to solve other optimization problems. Feasibility and efficiency are also substantiated by simulation examples.

  12. User's guide for SOL/QPSOL: a Fortran package for quadratic programming

    Energy Technology Data Exchange (ETDEWEB)

    Gill, P.E.; Murray, W.; Saunders, M.A.; Wright, M.H.

    1983-07-01

    This report forms the user's guide for Version 3.1 of SOL/QPSOL, a set of Fortran subroutines designed to locate the minimum value of an arbitrary quadratic function subject to linear constraints and simple upper and lower bounds. If the quadratic function is convex, a global minimum is found; otherwise, a local minimum is found. The method used is most efficient when many constraints or bounds are active at the solution. QPSOL treats the Hessian and general constraints as dense matrices, and hence is not intended for large sparse problems. This document replaces the previous user's guide of June 1982.

  13. A noncommutative convexity in C*-bimodules

    Directory of Open Access Journals (Sweden)

    Mohsen Kian

    2017-02-01

    Full Text Available Let A and B be C*-algebras. We consider a noncommutative convexity in Hilbert A-B-bimodules, called A-B-convexity, as a generalization of C*-convexity in C*-algebras. We show that if X is a Hilbert A-B-bimodule, then Mn(X is a Hilbert Mn(A-Mn(B-bimodule and apply it to show that the closed unit ball of every Hilbert A-B-bimodule is A-B-convex. Some properties of this kind of convexity and various examples have been given.

  14. Quantum quadratic operators and processes

    CERN Document Server

    Mukhamedov, Farrukh

    2015-01-01

    Covering both classical and quantum approaches, this unique and self-contained book presents the most recent developments in the theory of quadratic stochastic operators and their Markov and related processes. The asymptotic behavior of dynamical systems generated by classical and quantum quadratic operators is investigated and various properties of quantum quadratic operators are studied, providing an insight into the construction of quantum channels. This book is suitable as a textbook for an advanced undergraduate/graduate level course or summer school in quantum dynamical systems. It can also be used as a reference book by researchers looking for interesting  problems to work on, or useful techniques and discussions of particular problems. Since it includes the latest developments in the fields of quadratic dynamical systems, Markov processes and quantum stochastic processes, researchers at all levels are likely to find the book inspiring and useful.

  15. Quadratic Tangles in Planar Algebras

    CERN Document Server

    Jones, Vaughan F R

    2010-01-01

    In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.

  16. Evaluating convex roof entanglement measures.

    Science.gov (United States)

    Tóth, Géza; Moroder, Tobias; Gühne, Otfried

    2015-04-24

    We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.

  17. Effects of quadratic and cubic nonlinearities on a perfectly tuned parametric amplifier

    Science.gov (United States)

    Neumeyer, S.; Sorokin, V. S.; Thomsen, J. J.

    2017-01-01

    We consider the performance of a parametric amplifier with perfect tuning (two-to-one ratio between the parametric and direct excitation frequencies) and quadratic and cubic nonlinearities. A forced Duffing-Mathieu equation with appended quadratic nonlinearity is considered as the model system, and approximate analytical steady-state solutions and corresponding stabilities are obtained by the method of varying amplitudes. Some general effects of pure quadratic, and mixed quadratic and cubic nonlinearities on parametric amplification are shown. In particular, the effects of mixed quadratic and cubic nonlinearities may generate additional amplitude-frequency solutions. In this case an increased response and a more phase sensitive amplitude (phase between excitation frequencies) is obtained, as compared to the case with either pure quadratic or cubic nonlinearity. Furthermore, jumps and bi-stability in the amplitude-phase characteristics are predicted, supporting previously reported experimental observations.

  18. Convex Hulls of Algebraic Sets

    CERN Document Server

    Gouveia, João

    2010-01-01

    This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of polynomials and the dual theory of moment matrices. The main feature of the technique is that all computations are done modulo the ideal generated by the polynomials defining the set to the convexified. This work was motivated by questions raised by Lov\\'asz concerning extensions of the theta body of a graph to arbitrary real algebraic varieties, and hence the relaxations described here are called theta bodies. The convexification process can be seen as an incarnation of Lasserre's hierarchy of convex relaxations of a semialgebraic set in R^n. When the defining ideal is real radical the results become especially nice. We provide several examples of the method and discuss convergence issues. Finite convergence, especially after the first step of the method, can be described expl...

  19. A new gradient-based neural network for solving linear and quadratic programming problems.

    Science.gov (United States)

    Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S

    2001-01-01

    A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.

  20. Convex optimization approach to the fusion of identity information

    Science.gov (United States)

    Li, Lingjie; Luo, Zhi-Quan; Wong, Kon M.; Bosse, Eloi

    1999-03-01

    We consider the problem of identity fusion for a multi- sensor target tracking system whereby sensors generate reports on the target identities. Since the sensor reports are typically fuzzy, 'incomplete' and inconsistent, the fusion approach based on the minimization of inconsistencies between the sensor reports by using a convex Quadratic Programming (QP) and linear programming (LP) formulation. In contrast to the Dempster-Shafer's evidential reasoning approach which suffers from exponentially growing completely, our approach is highly efficient. Moreover, our approach is capable of fusing 'ratio type' sensor reports, thus it is more general than the evidential reasoning theory. When the sensor reports are consistent, the solution generated by the new fusion method can be shown to converge to the true probability distribution. Simulation work shows that our method generates reasonable fusion results, and when only 'Subset type' sensor reports are presented, it produces fusion results similar to that obtained via the evidential reasoning theory.

  1. Use of Convexity in Ostomy Care

    Science.gov (United States)

    Salvadalena, Ginger; Pridham, Sue; Droste, Werner; McNichol, Laurie; Gray, Mikel

    2017-01-01

    Ostomy skin barriers that incorporate a convexity feature have been available in the marketplace for decades, but limited resources are available to guide clinicians in selection and use of convex products. Given the widespread use of convexity, and the need to provide practical guidelines for appropriate use of pouching systems with convex features, an international consensus panel was convened to provide consensus-based guidance for this aspect of ostomy practice. Panelists were provided with a summary of relevant literature in advance of the meeting; these articles were used to generate and reach consensus on 26 statements during a 1-day meeting. Consensus was achieved when 80% of panelists agreed on a statement using an anonymous electronic response system. The 26 statements provide guidance for convex product characteristics, patient assessment, convexity use, and outcomes. PMID:28002174

  2. CONVEX CLASS OF STARLIKE FUNCTIONS

    OpenAIRE

    Gupta, V. P.

    1984-01-01

    Let $S$ denote the class of functions of the form $f(z)=z-¥sum_{n=2}^{¥infty}|a_{n}|z^{n}$ that are analytic and univalent in the unit disk $U$. Let $S(¥alpha, ¥beta)$ and $K(¥alpha, ¥beta)$ denote the subclasses of $S$ consisting respectively, of starlike and close-to-convex functions of order $¥alpha(0¥leqq¥alpha

  3. Finite dimensional convexity and optimization

    CERN Document Server

    Florenzano, Monique

    2001-01-01

    The primary aim of this book is to present notions of convex analysis which constitute the basic underlying structure of argumentation in economic theory and which are common to optimization problems encountered in many applications. The intended readers are graduate students, and specialists of mathematical programming whose research fields are applied mathematics and economics. The text consists of a systematic development in eight chapters, with guided exercises containing sometimes significant and useful additional results. The book is appropriate as a class text, or for self-study.

  4. Students' understanding of quadratic equations

    Science.gov (United States)

    López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael

    2016-05-01

    Action-Process-Object-Schema theory (APOS) was applied to study student understanding of quadratic equations in one variable. This required proposing a detailed conjecture (called a genetic decomposition) of mental constructions students may do to understand quadratic equations. The genetic decomposition which was proposed can contribute to help students achieve an understanding of quadratic equations with improved interrelation of ideas and more flexible application of solution methods. Semi-structured interviews with eight beginning undergraduate students explored which of the mental constructions conjectured in the genetic decomposition students could do, and which they had difficulty doing. Two of the mental constructions that form part of the genetic decomposition are highlighted and corresponding further data were obtained from the written work of 121 undergraduate science and engineering students taking a multivariable calculus course. The results suggest the importance of explicitly considering these two highlighted mental constructions.

  5. Finite dimensional quadratic Lie superalgebras

    CERN Document Server

    Jarvis, Peter; Yates, Luke

    2010-01-01

    We consider a special class of Z_2-graded, polynomial algebras of degree 2, which we call quadratic Lie superalgebras. Starting from the formal definition, we discuss the generalised Jacobi relations in the context of the Koszul property, and give a proof of the PBW basis theorem. We give several concrete examples of quadratic Lie superalgebras for low dimensional cases, and discuss aspects of their structure constants for the `type I' class. Based on the factorisation of the enveloping algebra, we derive the Kac module construction for typical and atypical modules, and a related direct construction of irreducible modules due to Gould. We investigate the method for one specific case, the quadratic generalisation gl_2(n/1) of the Lie superalgebra sl(n/1). We formulate the general atypicality conditions at level 1, and present an analysis of zero-and one-step atypical modules for a certain family of Kac modules.

  6. A New Interpolation Approach for Linearly Constrained Convex Optimization

    KAUST Repository

    Espinoza, Francisco

    2012-08-01

    In this thesis we propose a new class of Linearly Constrained Convex Optimization methods based on the use of a generalization of Shepard\\'s interpolation formula. We prove the properties of the surface such as the interpolation property at the boundary of the feasible region and the convergence of the gradient to the null space of the constraints at the boundary. We explore several descent techniques such as steepest descent, two quasi-Newton methods and the Newton\\'s method. Moreover, we implement in the Matlab language several versions of the method, particularly for the case of Quadratic Programming with bounded variables. Finally, we carry out performance tests against Matab Optimization Toolbox methods for convex optimization and implementations of the standard log-barrier and active-set methods. We conclude that the steepest descent technique seems to be the best choice so far for our method and that it is competitive with other standard methods both in performance and empirical growth order.

  7. 具有二次约束的二次规划全局最优性条件∗%Global Optimality Conditions for Quadratic Program Problems with Quadratic Constraints

    Institute of Scientific and Technical Information of China (English)

    周雪刚

    2015-01-01

    In this paper, sufficient global optimality conditions are presented for nonconvex quadratic programming problems with quadratic constraints as well as hyperrectangle constr-aints. The new conditions are obtained by making use of quadratic underestimators of quadratic function. We first introduce how to construct quadratic underestimators of quadratic function. Then, by using convex quadratic underestimators of the Lagrangian function at the Karush-Kuhn-Tucker point, we establish sufficient global optimality conditions for nonconvex quadratic programming problems. And we propose sufficient global optimality conditions by utilizing the minimum eigenvalue and quadratic underestimators. Finally, by using quadratic underestima-tors, we establish the sufficient condition for nonconvex quadratic programming problems with quadratic constraints.%本文讨论具有二次约束与超矩形约束的非凸二次规划问题的新型全局最优性充分条件,这些新的全局最优性充分条件是利用二次函数的二次下估计函数获得的。我们首先介绍如何构造二次函数的下估计函数。然后利用在KKT点处的拉格朗日函数的凸二次下估计函数建立非凸二次规划问题的全局最优性充分条件,再利用最小特征根与二次下估计函数获得它的全局最优性充分条件。最后利用二次下估计函数建立具有二次约束的非凸二次规划问题的全局最优性充分条件。

  8. Uniformly convex subsets of the Hilbert space with modulus of convexity of the second order

    OpenAIRE

    Balashov, Maxim V.; Repovš, Dušan,

    2011-01-01

    We prove that in the Hilbert space every uniformly convex set with modulus of convexity of the second order at zero is an intersection of closed balls of fixed radius. We also obtain an estimate of this radius.

  9. Various Expressions for Modulus of Random Convexity

    Institute of Scientific and Technical Information of China (English)

    Xiao Lin ZENG

    2013-01-01

    We first prove various kinds of expressions for modulus of random convexity by using an Lo(F,R)-valued function's intermediate value theorem and the well known Hahn-Banach theorem for almost surely bounded random linear functionals,then establish some basic properties including continuity for modulus of random convexity.In particular,we express the modulus of random convexity of a special random normed module Lo(F,X) derived from a normed space X by the classical modulus of convexity of X.

  10. An Algorithm of Indefinite Quadratic Programming over Unbound Domain%无界域上不定二次规划的一个算法

    Institute of Scientific and Technical Information of China (English)

    戚中; 单锋

    2001-01-01

    给出了无界域上不定二次规划的一个算法,该算法将不定二次规划转化为一系列凸二次规划,并证明了算法的收敛性.%An algorithm of indefinite quadratic programming over unbound domain is presented; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed.

  11. Successive quadratic programming multiuser detector

    Institute of Scientific and Technical Information of China (English)

    Mu Xuewen; Zhang Yaling; Liu Sanyang

    2007-01-01

    Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem,a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefinite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.

  12. Variational viewpoint of the quadratic Markov measure field models: theory and algorithms.

    Science.gov (United States)

    Rivera, Mariano; Dalmau, Oscar

    2012-03-01

    We present a framework for image segmentation based on quadratic programming, i.e., by minimization of a quadratic regularized energy linearly constrained. In particular, we present a new variational derivation of the quadratic Markov measure field (QMMF) models, which can be understood as a procedure for regularizing model preferences (memberships or likelihoods). We also present efficient optimization algorithms. In the QMMFs, the uncertainty in the computed regularized probability measure field is controlled by penalizing Gini's coefficient, and hence, it affects the convexity of the quadratic programming problem. The convex case is reduced to the solution of a positive definite linear system, and for that case, an efficient Gauss-Seidel (GS) scheme is presented. On the other hand, we present an efficient projected GS with subspace minimization for optimizing the nonconvex case. We demonstrate the proposal capabilities by experiments and numerical comparisons with interactive two-class segmentation, as well as the simultaneous estimation of segmentation and (parametric and nonparametric) generative models. We present extensions to the original formulation for including color and texture clues, as well as imprecise user scribbles in an interactive framework.

  13. Mixed H2/H∞ filtering for a class of high-speed sampling uncertain systems

    Institute of Scientific and Technical Information of China (English)

    ZHANG Rui; YAO Yu; MA KeMao; CHEN SongLin

    2008-01-01

    The problem of mixed H2/H∞ filtering for polytopic Delta operator systems is inves-tigated. The aim is to design a linear asymptotically stable filter which guarantees that the filtering error system has different performances in different filtering channels. Based on a parameter-dependent Lyapunov function, a new mixed H2/H∞ performance criterion is presented. Upon this performance criterion, a sufficient condition for the full-order mixed H2/H∞ filter is derived in terms of linear matrix inequalities. The filter can be obtained from the solution of a convex optimization problem. The proposed filter design procedure is less conservative than the strat-egy based on the quadratic stability notion. A numerical example is given to illus-trate the feasibility of the proposed approach.

  14. Robust quadratic assignment problem with budgeted uncertain flows

    Directory of Open Access Journals (Sweden)

    Mohammad Javad Feizollahi

    2015-12-01

    Full Text Available We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact quadratic formulation as a robust counterpart and develop an equivalent mixed integer programming model for it. To solve the proposed model for large-scale instances, we also develop two different heuristics based on 2-Opt local search and tabu search algorithms. We discuss performance of these methods and the quality of robust solutions through extensive computational experiments.

  15. A smoothing Newton method for a type of inverse semi-definite quadratic programming problem

    Science.gov (United States)

    Xiao, Xiantao; Zhang, Liwei; Zhang, Jianzhong

    2009-01-01

    We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC1) convex programming problem with fewer variables than the original one. The Karush-Kuhn-Tucker conditions of the dual problem (ISDQD) can be formulated as a system of semismooth equations which involves the projection onto the cone of positive semi-definite matrices. A smoothing Newton method is given for getting a Karush-Kuhn-Tucker point of ISDQD. The proposed method needs to compute the directional derivative of the smoothing projector at the corresponding point and to solve one linear system per iteration. The quadratic convergence of the smoothing Newton method is proved under a suitable condition. Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this type of inverse quadratic programming problems.

  16. DIFFERENTIABILITY OF CONVEX FUNCTIONS ON SUBLINEAR TOPOLOGICAL SPACES AND VARIATIONAL PRINCIPLES IN LOCALLY CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    CHENG LIXIN; TENG YANMEI

    2005-01-01

    This paper presents a type of variational principles for real valued w* lower semicon tinuous functions on certain subsets in duals of locally convex spaces, and resolve a problem concerning differentiability of convex functions on general Banach spaces. They are done through discussing differentiability of convex functions on nonlinear topological spaces and convexification of nonconvex functions on topological linear spaces.

  17. A simple view on convex analysis and its applications

    NARCIS (Netherlands)

    J. Brinkhuis (Jan); V. Tikhomirov

    2005-01-01

    textabstractOur aim is to give a simple view on the basics and applications of convex analysis. The essential feature of this account is the systematic use of the possibility to associate to each convex object---such as a convex set, a convex function or a convex extremal problem--- a cone, without

  18. Entropy coherent and entropy convex measures of risk

    NARCIS (Netherlands)

    Laeven, R.J.A.; Stadje, M.

    2013-01-01

    We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. Entropy coherent and entropy convex measures of risk are special cases of φ-coherent and φ-convex measures of risk. Contrary to the classical use of coherent and convex measur

  19. Mixed

    Directory of Open Access Journals (Sweden)

    Pau Baya

    2011-05-01

    Full Text Available Remenat (Catalan (Mixed, "revoltillo" (Scrambled in Spanish, is a dish which, in Catalunya, consists of a beaten egg cooked with vegetables or other ingredients, normally prawns or asparagus. It is delicious. Scrambled refers to the action of mixing the beaten egg with other ingredients in a pan, normally using a wooden spoon Thought is frequently an amalgam of past ideas put through a spinner and rhythmically shaken around like a cocktail until a uniform and dense paste is made. This malleable product, rather like a cake mixture can be deformed pulling it out, rolling it around, adapting its shape to the commands of one’s hands or the tool which is being used on it. In the piece Mixed, the contortion of the wood seeks to reproduce the plasticity of this slow heavy movement. Each piece lays itself on the next piece consecutively like a tongue of incandescent lava slowly advancing but with unstoppable inertia.

  20. On the convex hull of symmetric stable processes

    CERN Document Server

    Kampf, Jürgen

    2010-01-01

    Let alpha \\in (1, 2] and X be an R^d-valued alpha-stable process with independent and symmetric components starting in 0. We consider the closure S_t of the path described by X on the interval [0, t] and its convex hull Z_t. The first result of this paper provides a formula for certain mean mixed volumes of Z_t and in particular for the expected first intrinsic volume of Z_t. The second result deals with the asymptotics of the expected volume of the stable sausage Z_t+B (where B is an arbitrary convex body with interior points) as t \\to 0.

  1. Unramified extensions of quadratic fields

    Institute of Scientific and Technical Information of China (English)

    Wei Li; Dong Yang; Xianke Zhang

    2008-01-01

    Let K be a global quadratic field, then every unramified abelian extension of K is proved to be absolutely Galois when K is a number field or under some natural conditions when K is a function field. The absolute Galois group is also determined explicitly.

  2. Quadratic prediction of factor scores

    NARCIS (Netherlands)

    Wansbeek, T

    1999-01-01

    Factor scores are naturally predicted by means of their conditional expectation given the indicators y. Under normality this expectation is linear in y but in general it is an unknown function of y. II is discussed that under nonnormality factor scores can be more precisely predicted by a quadratic

  3. Quadratic Variation by Markov Chains

    DEFF Research Database (Denmark)

    Hansen, Peter Reinhard; Horel, Guillaume

    We introduce a novel estimator of the quadratic variation that is based on the the- ory of Markov chains. The estimator is motivated by some general results concerning filtering contaminated semimartingales. Specifically, we show that filtering can in prin- ciple remove the effects of market...

  4. A Polynomial Primal-Dual Interior Point Method for Convex Programming with Quadratic Constraints

    Science.gov (United States)

    1993-04-01

    Delft Un~versity of Technology, Delft, Netherlands. [3H Bazaraa , M. S., J. J. Jarvis, and H. D. Sh’rali. 199a Linar Pgrammning a" N]tdiwk Flow, John... Bazaraa , M. S., J. J. Jarvis, and H. D. Sherali. 1990. IjnW Programming and Network Flw, John Wiley and Sons, New York. [4] Charnes, A., and K. 0. Kortanek...often used in linear programming. For a detailed discussion of that 90 application, see Bazaraa . Jarvis. and Sherali(1990). Given J£, let T denote the

  5. Simulation of superconducting tapes and coils with convex quadratic programming method

    Science.gov (United States)

    Zhang, Yan; Song, Yuntao; Wang, Lei; Liu, Xufeng

    2015-08-01

    Second-generation (2G) high-temperature superconducting coated conductors are playing an increasingly important role in power applications due to their large current density under high magnetic fields. In this paper, we conclude and explore the ability and possible potential of J formulation from the mathematical modeling point of view. An equivalent matrix form of J formulation has been presented and a relation between electromagnetic quantities and Karush-Kuhn-Tucker (KKT) conditions in optimization theory has been discovered. The use of the latest formulae to calculate inductance in a coil system and the primal-dual interior-point method algorithm is a trial to make the process of modeling stylized and build a bridge to commercial optimization solvers. Two different dependences of the critical current density on the magnetic field have been used in order to make a comparison with those published papers.

  6. A combined strategy for solving quadratic assignment problem

    Science.gov (United States)

    Ahyaningsih, Faiz

    2017-08-01

    The quadratic assignment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of flow between facilities, and distance between location. Due to the non-convexity nature of the problem, therefore to get a `good' starting point is necessary in order to obtain a better optimal solution. In this paper we propose a combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get `optimal' solution). As a computational experience we've solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data -Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.

  7. Efficient Line Searching for Convex Functions

    NARCIS (Netherlands)

    den Boef, E.; den Hertog, D.

    2004-01-01

    In this paper we propose two new line search methods for convex functions. These new methods exploit the convexity property of the function, contrary to existing methods.The worst method is an improved version of the golden section method.For the second method it is proven that after two evaluations

  8. Introduction to Convex and Quasiconvex Analysis

    NARCIS (Netherlands)

    J.B.G. Frenk (Hans); G. Kassay

    2004-01-01

    textabstractIn the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the re

  9. Stochastic Dominance: Convexity and Some Efficiency Tests

    NARCIS (Netherlands)

    A.M. Lizyayev (Andrey)

    2009-01-01

    textabstractThis paper points out the importance of Stochastic Dominance (SD) efficient sets being convex. We review classic convexity and efficient set characterization results on SD efficiency of a given portfolio relative to a diversified set of assets and generalize them in the following

  10. Convex trace functions of several variables

    DEFF Research Database (Denmark)

    Hansen, Frank

    2002-01-01

    We prove that the function (x1,...,xk)¿Tr(f(x1,...,xk)), defined on k-tuples of symmetric matrices of order (n1,...,nk) in the domain of f, is convex for any convex function f of k variables. The matrix f(x1,...,xk) is defined by the functional calculus for functions of several variables, and it ...

  11. Polar DuaLs of Convex Bodies

    Science.gov (United States)

    1990-01-01

    to Convex Bodies, Geometriae Dedicata 2" (1973) 225-248. 10. H. Guggenheimer, "The Analytic Geometry of the Unsymmetric Minkowski Plane," Lecture...Mathematics, Vol. 58, No. 2, 1975. 19. E. Lutwak, "On Cross-Sectional Measures of Polar Reciprocal Convex Bodies," Geometriae Dedicata 5, (1976) 79-80

  12. Differential analysis of matrix convex functions II

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2009-01-01

    We continue the analysis in [F. Hansen, and J. Tomiyama, Differential analysis of matrix convex functions. Linear Algebra Appl., 420:102--116, 2007] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divide...

  13. The Band around a Convex Body

    Science.gov (United States)

    Swanson, David

    2011-01-01

    We give elementary proofs of formulas for the area and perimeter of a planar convex body surrounded by a band of uniform thickness. The primary tool is a integral formula for the perimeter of a convex body which describes the perimeter in terms of the projections of the body onto lines in the plane.

  14. Strictly convex functions on complete Finsler manifolds

    Indian Academy of Sciences (India)

    YOE ITOKAWA; KATSUHIRO SHIOHAMA; BANKTESHWAR TIWARI

    2016-10-01

    The purpose of the present paper is to investigate the influence of strictly convex functions on the metric structures of complete Finsler manifolds. More precisely we discuss the properties of the group of isometries and the exponential maps on a complete Finsler manifold admitting strictly convex functions.

  15. Toric geometry of convex quadrilaterals

    CERN Document Server

    Legendre, Eveline

    2009-01-01

    We provide an explicit resolution of the Abreu equation on convex labeled quadrilaterals. This confirms a conjecture of Donaldson in this particular case and implies a complete classification of the explicit toric K\\"ahler-Einstein and toric Sasaki-Einstein metrics constructed in [6,23,14]. As a byproduct, we obtain a wealth of extremal toric (complex) orbi-surfaces, including K\\"ahler-Einstein ones, and show that for a toric orbi-surface with 4 fixed points of the torus action, the vanishing of the Futaki invariant is a necessary and sufficient condition for the existence of K\\"ahler metric with constant scalar curvature. Our results also provide explicit examples of relative K-unstable toric orbi-surfaces that do not admit extremal metrics.

  16. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    The set of all surface tensors of a convex body K (Minkowski tensors derived from the surface area measure of K) determine K up to translation, and hereby, the surface tensors of K contain all information on the shape of K. Here, shape means the equivalence class of all convex bodies...... that are translates of each other. An algorithm for reconstructing an unknown convex body in R 2 from its surface tensors up to a certain rank is presented. Using the reconstruction algorithm, the shape of an unknown convex body can be approximated when only a finite number s of surface tensors are available....... The output of the reconstruction algorithm is a polytope P, where the surface tensors of P and K are identical up to rank s. We establish a stability result based on a generalization of Wirtinger’s inequality that shows that for large s, two convex bodies are close in shape when they have identical surface...

  17. Convex functions, monotone operators and differentiability

    CERN Document Server

    Phelps, Robert R

    1993-01-01

    The improved and expanded second edition contains expositions of some major results which have been obtained in the years since the 1st edition. Theaffirmative answer by Preiss of the decades old question of whether a Banachspace with an equivalent Gateaux differentiable norm is a weak Asplund space. The startlingly simple proof by Simons of Rockafellar's fundamental maximal monotonicity theorem for subdifferentials of convex functions. The exciting new version of the useful Borwein-Preiss smooth variational principle due to Godefroy, Deville and Zizler. The material is accessible to students who have had a course in Functional Analysis; indeed, the first edition has been used in numerous graduate seminars. Starting with convex functions on the line, it leads to interconnected topics in convexity, differentiability and subdifferentiability of convex functions in Banach spaces, generic continuity of monotone operators, geometry of Banach spaces and the Radon-Nikodym property, convex analysis, variational princ...

  18. A Note on Upper Convex Density

    Institute of Scientific and Technical Information of China (English)

    YIN JIAN-DONG; ZHOU ZUO-LING

    2010-01-01

    For a self-similar set E satisfying the open set condition,upper convex density is an important concept for the computation of its Hausdorff measure,and it is well known that the set of relative interior points with upper convex density 1has a full Hausdorff measure.But whether the upper convex densities of E at all the relative interior points are equal to 1? In other words,whether there exists a relative interior point of E such that the upper convex density of E at this point is less than 1?In this paper,the authors construct a self-similar set satisfying the open set condition,which has a relative interior point with upper convex density less than 1.Thereby,the above problem is sufficiently answered.

  19. Generalized convexity, generalized monotonicity recent results

    CERN Document Server

    Martinez-Legaz, Juan-Enrique; Volle, Michel

    1998-01-01

    A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo­ metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man­ agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...

  20. A plasticity principle of convex quadrilaterals on a complete convex surface of bounded specific curvature

    CERN Document Server

    Zachos, Anastasios

    2010-01-01

    We obtain the plasticity equations for convex quadrilaterals on a complete convex surface with bounded specific curvature and derive a plasticity principle which states that: Given four shortest arcs which meet at the weighted Fermat-Torricelli point P_F and their endpoints form a convex quadrilateral, an increase of the weight that corresponds to a shortest arc causes a decrease to the two weights that correspond to the two neighboring shortest arcs and an increase to the weight that corresponds to the opposite shortest arc. We show a connection between the plasticity of convex quadrilaterals on a complete convex surface with bounded specific curvature with the plasticity of generalized convex quadrilaterals on a manifold which is composed by triangles located on a complete convex surface of bounded specific curvature and triangles located on a two dimensional sphere whose constant Gaussian curvature equals to the infimum or supremum of the specific curvature. Furthermore, we give some cases of geometrizatio...

  1. Quadratic and 2-Crossed Modules of Algebras

    Institute of Scientific and Technical Information of China (English)

    Z. Arvasi; E. Ulualan

    2007-01-01

    In this work, we define the quadratic modules for commutative algebras and give relations among 2-crossed modules, crossed squares, quadratic modules and simplicial commutative algebras with Moore complex of length 2.

  2. A polyhedral approach to quadratic assignment problem

    OpenAIRE

    Köksaldı, Ahmet Sertaç Murat

    1994-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references. In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems has been limited to instances of small dimension. In...

  3. Orthogonality preserving infinite dimensional quadratic stochastic operators

    Energy Technology Data Exchange (ETDEWEB)

    Akın, Hasan [Department of Mathematics, Faculty of Education, Zirve University, Gaziantep, 27260 (Turkey); Mukhamedov, Farrukh [Department of Computational & Theoretical Sciences Faculty of Science, International Islamic University Malaysia P.O. Box, 141, 25710, Kuantan Pahang (Malaysia)

    2015-09-18

    In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.

  4. Quantum bouncer with quadratic dissipation

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez, G. [NanoScience Technology Center, University of Central Florida, Orlando, FL 32826 (United States)]. e-mail: ggonzalez@physics.ucf.edu

    2008-07-01

    The energy loss due to a quadratic velocity-dependent force on a quantum particle bouncing off a perfectly reflecting surface is obtained for a full cycle of motion. We approach this problem by means of a new, effective, phenomenological Hamiltonian which corresponds to the actual energy of the system and obtain the correction to the eigenvalues of the energy in first-order quantum perturbation theory for the case of weak dissipation. (Author)

  5. Quantum bouncer with quadratic dissipation

    Science.gov (United States)

    González, G.

    2008-02-01

    The energy loss due to a quadratic velocity dependent force on a quantum particle bouncing on a perfectly reflecting surface is obtained for a full cycle of motion. We approach this problem by means of a new effective phenomenological Hamiltonian which corresponds to the actual energy of the system and obtained the correction to the eigenvalues of the energy in first order quantum perturbation theory for the case of weak dissipation.

  6. Global Optimization of a Class of Nonconvex Quadratically Constrained Quadratic Programming Problems

    Institute of Scientific and Technical Information of China (English)

    Yong XIA

    2011-01-01

    In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems.We show that each problem is polynomially solved.Strong duality holds if a redundant constraint is introduced.As an application,a new lower bound is proposed for the quadratic assignment problem.

  7. Quasi-convex Functions in Carnot Groups

    Institute of Scientific and Technical Information of China (English)

    Mingbao SUN; Xiaoping YANG

    2007-01-01

    In this paper, the authors introduce the concept of h-quasiconvex functions on Carnot groups G. It is shown that the notions of h-quasiconvex functions and h-convex sets are equivalent and the L∞ estimates of first derivatives of h-quasiconvex functions are given. For a Carnot group G of step two, it is proved that h-quasiconvex functions are locally bounded from above. Furthermore, the authors obtain that h-convex functions are locally Lipschitz continuous and that an h-convex function is twice differentiable almost everywhere.

  8. On the vertex index of convex bodies

    CERN Document Server

    Bezdek, Karoly

    2011-01-01

    We introduce the vertex index, vein(K), of a given centrally symmetric convex body K, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the illumination parameter of a body, introduced earlier by the first named author, and, thus, related to the famous conjecture in Convex Geometry about covering of a d-dimensional body by 2^d smaller positively homothetic copies. We provide asymptotically sharp estimates (up to a logarithmic term) of this index in the general case. Also, we provide sharp estimates in dimensions 2 and 3.

  9. L2CXCV: A Fortran 77 package for least squares convex/concave data smoothing

    Science.gov (United States)

    Demetriou, I. C.

    2006-04-01

    Fortran 77 software is given for least squares smoothing to data values contaminated by random errors subject to one sign change in the second divided differences of the smoothed values, where the location of the sign change is also unknown of the optimization problem. A highly useful description of the constraints is that they follow from the assumption of initially increasing and subsequently decreasing rates of change, or vice versa, of the process considered. The underlying algorithm partitions the data into two disjoint sets of adjacent data and calculates the required fit by solving a strictly convex quadratic programming problem for each set. The piecewise linear interpolant to the fit is convex on the first set and concave on the other one. The partition into suitable sets is achieved by a finite iterative algorithm, which is made quite efficient because of the interactions of the quadratic programming problems on consecutive data. The algorithm obtains the solution by employing no more quadratic programming calculations over subranges of data than twice the number of the divided differences constraints. The quadratic programming technique makes use of active sets and takes advantage of a B-spline representation of the smoothed values that allows some efficient updating procedures. The entire code required to implement the method is 2920 Fortran lines. The package has been tested on a variety of data sets and it has performed very efficiently, terminating in an overall number of active set changes over subranges of data that is only proportional to the number of data. The results suggest that the package can be used for very large numbers of data values. Some examples with output are provided to help new users and exhibit certain features of the software. Important applications of the smoothing technique may be found in calculating a sigmoid approximation, which is a common topic in various contexts in applications in disciplines like physics, economics

  10. Iterative Schemes for Convex Minimization Problems with Constraints

    Directory of Open Access Journals (Sweden)

    Lu-Chuan Ceng

    2014-01-01

    Full Text Available We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.

  11. Noah, Joseph and Convex Hulls

    Science.gov (United States)

    Watkins, N. W.; Chau, Y.; Chapman, S. C.

    2010-12-01

    The idea of describing animal movement by mathematical models based on diffusion and Brownian motion has a long heritage. It has thus been natural to account for those aspects of motion that depart from the Brownian by the use of models incorporating long memory & subdiffusion (“the Joseph effect”) and/or heavy tails & superdiffusion (“the Noah effect”). My own interest in this problem was originally from a geoscience perspective, and was triggered by the need to model time series in space physics where both effects coincide. Subsequently I have been involved in animal foraging studies [e.g. Edwards et al, Nature, 2007]. I will describe some recent work [Watkins et al, PRE, 2009] which studies how fixed-timestep and variable-timestep formulations of anomalous diffusion are related in the presence of heavy tails and long range memory (stable processes versus the CTRW). Quantities for which different scaling relations are predicted between the two approaches are of particular interest, to aid testability. I will also present some of work in progress on the convex hull of anomalously diffusing walkers, inspired by its possible relevance to the idea of home range in biology, and by Randon-Furling et al’s recent analytical results in the Brownian case [PRL, 2009].

  12. Global optimization of quadratic programming problem with quadratic constraints%带有二次约束二次规划问题的全局最优化

    Institute of Scientific and Technical Information of China (English)

    马小华; 魏飞; 高岳林

    2013-01-01

    According to the special structure of quadratic programming model with quadratic constraints and using the convex envelope and concave envelope of the product,the relaxation linear programming problem of quadratic programming with quadratic constraints was proposed so as to determine the lower bound of the global optimum.Using the hyper-rectangular reduction technique,the convergence speed of the branch-and-bound algorithm was accelerated.Thus,a global optimization algorithm was presented for solving quadratic programming problem with quadratic constraints and the convergence of the algorithm was proved.The new algorithm was actually an organically combined one of branch-and-bound with outer approximation.Numerical example showed that the proposed algorithm was feasible.%根据带有二次约束二次规划模型的特殊结构,利用乘积的凸包络和凹包络,给出带有二次约束二次规划问题的松弛线性规划问题,以确定全局最优值的下界,使用超矩形缩减技术以加快分支定界算法的收敛速度,从而提出一个求解带有二次约束二次规划问题的全局最优化算法,证明该算法的收敛性,这个新算法实际上是把分支定界方法与外逼近方法有机地结合起来.数值算例表明所提出的算法是可行的.

  13. A Riccati approach for constrained linear quadratic optimal control

    Science.gov (United States)

    Sideris, Athanasios; Rodriguez, Luis A.

    2011-02-01

    An active-set method is proposed for solving linear quadratic optimal control problems subject to general linear inequality path constraints including mixed state-control and state-only constraints. A Riccati-based approach is developed for efficiently solving the equality constrained optimal control subproblems generated during the procedure. The solution of each subproblem requires computations that scale linearly with the horizon length. The algorithm is illustrated with numerical examples.

  14. Revising incompletely specified convex probabilistic belief bases

    CSIR Research Space (South Africa)

    Rens, G

    2016-04-01

    Full Text Available International Workshop on Non-Monotonic Reasoning (NMR), 22-24 April 2016, Cape Town, South Africa Revising Incompletely Specified Convex Probabilistic Belief Bases Gavin Rens CAIR_, University of KwaZulu-Natal, School of Mathematics, Statistics...

  15. Relations between Lipschitz functions and convex functions

    Institute of Scientific and Technical Information of China (English)

    RUAN Yingbin

    2005-01-01

    We discuss the relationship between Lipschitz functions and convex functions.By these relations, we give a sufficient condition for the set of points where Lipschitz functions on a Hilbert space is Frechet differentiable to be residual.

  16. Some integral inequalities for logarithmically convex functions

    Directory of Open Access Journals (Sweden)

    Mevlüt Tunç

    2014-07-01

    Full Text Available The main aim of the present note is to establish new Hadamard like integral inequalities involving log-convex function. We also prove some Hadamard-type inequalities, and applications to the special means are given.

  17. Convex analysis and optimization in Hadamard spaces

    CERN Document Server

    Bacak, Miroslav

    2014-01-01

    This book gives a first systematic account on the subject of convex analysis and optimization in Hadamard spaces. It is primarily aimed at both graduate students and researchers in analysis and optimization.

  18. A convex formulation for hyperspectral image superresolution via subspace-based regularization

    CERN Document Server

    Simões, Miguel; Almeida, Luis B; Chanussot, Jocelyn

    2014-01-01

    Hyperspectral remote sensing images (HSIs) usually have high spectral resolution and low spatial resolution. Conversely, multispectral images (MSIs) usually have low spectral and high spatial resolutions. The problem of inferring images which combine the high spectral and high spatial resolutions of HSIs and MSIs, respectively, is a data fusion problem that has been the focus of recent active research due to the increasing availability of HSIs and MSIs retrieved from the same geographical area. We formulate this problem as the minimization of a convex objective function containing two quadratic data-fitting terms and an edge-preserving regularizer. The data-fitting terms account for blur, different resolutions, and additive noise. The regularizer, a form of vector Total Variation, promotes piecewise-smooth solutions with discontinuities aligned across the hyperspectral bands. The downsampling operator accounting for the different spatial resolutions, the non-quadratic and non-smooth nature of the regularizer,...

  19. Synthesis of a robust broadband duct ANC system using convex programming approach

    Science.gov (United States)

    Bai, Mingsian R.; Zeung, Pingshun

    2002-04-01

    A robust active controller using spatially feedforward structure is proposed for broadband attenuation of noise in ducts. To meet the requirements of performance and robust stability in the presence of plant uncertainties, an H2 cost function and an H∞ constrain are employed in the synthesis of the controller. The design is then converted into a convex programming problem using Q-parametrization and frequency discretization. An optimal controller that satisfies the quadratic cost functions and linear inequality constraints can be found by sequential quadratic programming. The optimal controller was implemented via a digital signal processor (DSP) and verified by experiments. Experiment results showed that the system attained 16.5 dB maximal attenuation and 5.9 dB total attenuation in the frequency band 200-600 Hz.

  20. Linearization functors on real convex sets

    OpenAIRE

    Velasco, Mauricio

    2012-01-01

    We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to efficient computation. These operations are convex analogues of Hom functors, tensor products, symmetric powers, exterior powers and general Schur functors on vector spaces and lead to novel constructions even for polyhedra.

  1. Deformation in locally convex topological linear spaces

    Institute of Scientific and Technical Information of China (English)

    DING; Yanheng

    2004-01-01

    We are concerned with a deformation theory in locally convex topological linear spaces. A special "nice" partition of unity is given. This enables us to construct certain vector fields which are locally Lipschitz continuous with respect to the locally convex topology. The existence, uniqueness and continuous dependence of flows associated to the vector fields are established. Deformations related to strongly indefinite functionals are then obtained. Finally, as applications, we prove some abstract critical point theorems.

  2. The convexity radius of a Riemannian manifold

    OpenAIRE

    Dibble, James

    2014-01-01

    The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with focal points but no conjugate points. The approach is suggested by a characterization of the convexity radius that resembles a classical result of Klingenberg about the injectivity radius.

  3. Convexity conditions and normal structure of Banach spaces

    Science.gov (United States)

    Saejung, Satit

    2008-08-01

    We prove that F-convexity, the property dual to P-convexity of Kottman, implies uniform normal structure. Moreover, in the presence of the WORTH property, normal structure follows from a weaker convexity condition than F-convexity. The latter result improves the known fact that every uniformly nonsquare space with the WORTH property has normal structure.

  4. Entropy Coherent and Entropy Convex Measures of Risk

    NARCIS (Netherlands)

    Laeven, R.J.A.; Stadje, M.A.

    2011-01-01

    We introduce two subclasses of convex measures of risk, referred to as entropy coherent and entropy convex measures of risk. We prove that convex, entropy convex and entropy coherent measures of risk emerge as certainty equivalents under variational, homothetic and multiple priors preferences, respe

  5. A further characteristic of abstract convexity structures on topological spaces

    Science.gov (United States)

    Xiang, Shu-Wen; Xia, Shunyou

    2007-11-01

    In this paper, we give a characteristic of abstract convexity structures on topological spaces with selection property. We show that if a convexity structure defined on a topological space has the weak selection property then satisfies H0-condition. Moreover, in a compact convex subset of a topological space with convexity structure, the weak selection property implies the fixed point property.

  6. Exact and Approximate Sizes of Convex Datacubes

    Science.gov (United States)

    Nedjar, Sébastien

    In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. Previously, we have introduced the concept of convex cube which generalizes all the quoted variants of cubes. More precisely, the convex cube captures all the tuples satisfying a monotone and/or antimonotone constraint combination. This paper is dedicated to a study of the convex cube size. Actually, knowing the size of such a cube even before computing it has various advantages. First of all, free space can be saved for its storage and the data warehouse administration can be improved. However the main interest of this size knowledge is to choose at best the constraints to apply in order to get a workable result. For an aided calibrating of constraints, we propose a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded. Moreover we adapt the nearly optimal algorithm HyperLogLog in order to provide a very good approximation of the exact size of convex cubes. Our analytical results are confirmed by experiments: the approximated size of convex cubes is really close to their exact size and can be computed quasi immediately.

  7. Asymptotic Normality of Quadratic Estimators.

    Science.gov (United States)

    Robins, James; Li, Lingling; Tchetgen, Eric; van der Vaart, Aad

    2016-12-01

    We prove conditional asymptotic normality of a class of quadratic U-statistics that are dominated by their degenerate second order part and have kernels that change with the number of observations. These statistics arise in the construction of estimators in high-dimensional semi- and non-parametric models, and in the construction of nonparametric confidence sets. This is illustrated by estimation of the integral of a square of a density or regression function, and estimation of the mean response with missing data. We show that estimators are asymptotically normal even in the case that the rate is slower than the square root of the observations.

  8. quadratic spline finite element method

    Directory of Open Access Journals (Sweden)

    A. R. Bahadir

    2002-01-01

    Full Text Available The problem of heat transfer in a Positive Temperature Coefficient (PTC thermistor, which may form one element of an electric circuit, is solved numerically by a finite element method. The approach used is based on Galerkin finite element using quadratic splines as shape functions. The resulting system of ordinary differential equations is solved by the finite difference method. Comparison is made with numerical and analytical solutions and the accuracy of the computed solutions indicates that the method is well suited for the solution of the PTC thermistor problem.

  9. Optimal control linear quadratic methods

    CERN Document Server

    Anderson, Brian D O

    2007-01-01

    This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the

  10. Factorization method of quadratic template

    Science.gov (United States)

    Kotyrba, Martin

    2017-07-01

    Multiplication of two numbers is a one-way function in mathematics. Any attempt to distribute the outcome to its roots is called factorization. There are many methods such as Fermat's factorization, Dixońs method or quadratic sieve and GNFS, which use sophisticated techniques fast factorization. All the above methods use the same basic formula differing only in its use. This article discusses a newly designed factorization method. Effective implementation of this method in programs is not important, it only represents and clearly defines its properties.

  11. Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

    Institute of Scientific and Technical Information of China (English)

    Zhong-Zhi; Yu-Mei; K.

    2010-01-01

    Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term. A regularized convex term can usually preserve the image edges well in the restored image. In this paper, we consider a class of convex and edge-preserving regularization functions, I.e., multiplicative half-quadratic regularizations, and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations. At each Newton iterate, the preconditioned conjugate gradient method, incorporated with a constraint preconditioner, is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix.The igenvalue bounds of the preconditioned matrix are deliberately derived, which can be used to estimate the convergence speed of the preconditioned conjugate gradient method. We use experimental results to demonstrate that this new approach is efficient,and the effect of image restoration is r0easonably well.

  12. Quadratic reactivity fuel cycle model

    Energy Technology Data Exchange (ETDEWEB)

    Lewins, J.D.

    1985-11-01

    For educational purposes it is highly desirable to provide simple yet realistic models for fuel cycle and fuel economy. In particular, a lumped model without recourse to detailed spatial calculations would be very helpful in providing the student with a proper understanding of the purposes of fuel cycle calculations. A teaching model for fuel cycle studies based on a lumped model assuming the summability of partial reactivities with a linear dependence of reactivity usefully illustrates fuel utilization concepts. The linear burnup model does not satisfactorily represent natural enrichment reactors. A better model, showing the trend of initial plutonium production before subsequent fuel burnup and fission product generation, is a quadratic fit. The study of M-batch cycles, reloading 1/Mth of the core at end of cycle, is now complicated by nonlinear equations. A complete account of the asymptotic cycle for any order of M-batch refueling can be given and compared with the linear model. A complete account of the transient cycle can be obtained readily in the two-batch model and this exact solution would be useful in verifying numerical marching models. It is convenient to treat the parabolic fit rho = 1 - tau/sup 2/ as a special case of the general quadratic fit rho = 1 - C/sub tau/ - (1 - C)tau/sup 2/ in suitably normalized reactivity and cycle time units. The parabolic results are given in this paper.

  13. On Algebraic Approach in Quadratic Systems

    Directory of Open Access Journals (Sweden)

    Matej Mencinger

    2011-01-01

    Full Text Available When considering friction or resistance, many physical processes are mathematically simulated by quadratic systems of ODEs or discrete quadratic dynamical systems. Probably the most important problem when such systems are applied in engineering is the stability of critical points and (nonchaotic dynamics. In this paper we consider homogeneous quadratic systems via the so-called Markus approach. We use the one-to-one correspondence between homogeneous quadratic dynamical systems and algebra which was originally introduced by Markus in (1960. We resume some connections between the dynamics of the quadratic systems and (algebraic properties of the corresponding algebras. We consider some general connections and the influence of power-associativity in the corresponding quadratic system.

  14. A quadratic programming problem arising from vector precoding in wireless communications

    Science.gov (United States)

    Müller, R. R.; Guo, D.; Moustakas, A. L.

    2008-01-01

    A quadratic programming problem is studied in the limit of asymptotically large kernel matrices by means of the replica method. It is found that inverse Wishart kernels are—within the validity range of the replica symmetric solution—asymptotically invariant to Cartesian relaxations. In the context of vector precoding for wireless communication systems with dual antenna arrays, so-called MIMO systems, this implies that adding more transmit antennas cannot reduce the minimum required transmit energy per bit significantly. By contrast, a new convex relaxation is proposed and shown to be a practical and useful method.

  15. Sparsity based sub-wavelength imaging with partially incoherent light via quadratic compressed sensing

    CERN Document Server

    Shechtman, Yoav; Szameit, Alexander; Segev, Mordechai

    2011-01-01

    We demonstrate that sub-wavelength optical images borne on partially-spatially-incoherent light can be recovered, from their far-field or from the blurred image, given the prior knowledge that the image is sparse, and only that. The reconstruction method relies on the recently demonstrated sparsity-based sub-wavelength imaging. However, for partially-spatially-incoherent light, the relation between the measurements and the image is quadratic, yielding non-convex measurement equations that do not conform to previously used techniques. Consequently, we demonstrate new algorithmic methodology, referred to as quadratic compressed sensing, which can be applied to a range of other problems involving information recovery from partial correlation measurements, including when the correlation function has local dependencies. Specifically for microscopy, this method can be readily extended to white light microscopes with the additional knowledge of the light source spectrum.

  16. Fitting timeseries by continuous-time Markov chains: A quadratic programming approach

    Science.gov (United States)

    Crommelin, D. T.; Vanden-Eijnden, E.

    2006-09-01

    Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discrete-in-time Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuous-time Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.

  17. The Random Quadratic Assignment Problem

    Science.gov (United States)

    Paul, Gerald; Shao, Jia; Stanley, H. Eugene

    2011-11-01

    The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.

  18. A one-layer recurrent neural network with a discontinuous hard-limiting activation function for quadratic programming.

    Science.gov (United States)

    Liu, Q; Wang, J

    2008-04-01

    In this paper, a one-layer recurrent neural network with a discontinuous hard-limiting activation function is proposed for quadratic programming. This neural network is capable of solving a large class of quadratic programming problems. The state variables of the neural network are proven to be globally stable and the output variables are proven to be convergent to optimal solutions as long as the objective function is strictly convex on a set defined by the equality constraints. In addition, a sequential quadratic programming approach based on the proposed recurrent neural network is developed for general nonlinear programming. Simulation results on numerical examples and support vector machine (SVM) learning show the effectiveness and performance of the neural network.

  19. Optimization-based mesh correction with volume and convexity constraints

    Science.gov (United States)

    D'Elia, Marta; Ridzal, Denis; Peterson, Kara J.; Bochev, Pavel; Shashkov, Mikhail

    2016-05-01

    We consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. This volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

  20. -ree vibration analysis of cracked thin plates by quasi-convex coupled isogeometric-meshfree method

    Institute of Scientific and Technical Information of China (English)

    Hanjie ZHANG[1,2; JunzhaoWU[1,2; Dongdong WANG[1,2

    2015-01-01

    The free vibration analysis of cracked thin plates via a quasi-convex coupled isogeometric-meshfree method is presented. This formulation employs the consistently coupled isogeometric-meshfree strategy where a mixed basis vector of the convex B-splines is used to impose the consistency conditions throughout the whole problem domain. Meanwhile, the rigid body modes related to the mixed basis vector and reproducing conditions are also discussed. The mixed basis vector simultaneously offers the consistent isogeometric-meshfree coupling in the coupled region and the quasi-convex property for the meshfree shape functions in the meshfree region, which is particularly attractive for the vibration analysis. The quasi-convex meshfree shape functions mimic the isogeometric basis function as well as offer the meshfree nodal arrangement flexibility. Subsequently, this approach is exploited to study the free vibration analysis of cracked plates, in which the plate geometry is exactly represented by the isogeometric basis functions, while the cracks are discretized by meshfree nodes and highly smoothing approximation is invoked in the rest of the problem domain. The efficacy of the present method is illustrated through several numerical examples.

  1. Optimal convex shapes for concave functionals

    CERN Document Server

    Bucur, Dorin; Lamboley, Jimmy

    2011-01-01

    Motivated by a long-standing conjecture of Polya and Szeg\\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the Blaschke-concavity of variational functionals, including capacity. We then introduce a new algebraic structure on convex bodies, which allows to obtain global concavity and indecomposability results, and we discuss their application to isoperimetriclike inequalities. As a byproduct of this approach we also obtain a quantitative version of the Kneser-S\\"uss inequality. Finally, for a large class of functionals involving Dirichlet energies and the surface measure, we perform a local analysis of strictly convex portions of the boundary via second order shape derivatives. This allows in particular to exclude the presence of smooth regions with positive Gauss curvature in an optimal shape for Polya-Szeg\\"o problem.

  2. On the convexity of Relativistic Ideal Magnetohydrodynamics

    CERN Document Server

    Ibáñez, José-María; Aloy, Miguel-Ángel; Martí, José-María; Miralles, Juan-Antonio

    2015-01-01

    We analyze the influence of the magnetic field in the convexity properties of the relativistic magnetohydrodynamics system of equations. To this purpose we use the approach of Lax, based on the analysis of the linearly degenerate/genuinely non-linear nature of the characteristic fields. Degenerate and non-degenerate states are discussed separately and the non-relativistic, unmagnetized limits are properly recovered. The characteristic fields corresponding to the material and Alfv\\'en waves are linearly degenerate and, then, not affected by the convexity issue. The analysis of the characteristic fields associated with the magnetosonic waves reveals, however, a dependence of the convexity condition on the magnetic field. The result is expressed in the form of a generalized fundamental derivative written as the sum of two terms. The first one is the generalized fundamental derivative in the case of purely hydrodynamical (relativistic) flow. The second one contains the effects of the magnetic field. The analysis ...

  3. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2012-01-01

    We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.

  4. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...... problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...

  5. Non-convex multi-objective optimization

    CERN Document Server

    Pardalos, Panos M; Žilinskas, Julius

    2017-01-01

    Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in...

  6. Non-convex onion peeling using a shape hull algorithm

    OpenAIRE

    Fadili, Jalal M.; Melkemi, Mahmoud; Elmoataz, Abderrahim

    2004-01-01

    International audience; The convex onion-peeling of a set of points is the organization of these points into a sequence of interpolating convex polygons. This method is adequate to detect the shape of the “center” of a set of points when this shape is convex. However it reveals inadequate to detect non-convex shapes. Alternatively, we propose an extension of the convex onion-peeling method. It consists in representing a set of points with a sequence of non-convex polylines which are computed ...

  7. Uniform convexity and the splitting problem for selections

    CERN Document Server

    Balashov, Maxim V; 10.1016/j.jmaa.2009.06.045

    2009-01-01

    We continue to investigate cases when the Repov\\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces. We use the notion of Polyak of uniform convexity and modulus of uniform convexity for arbitrary convex sets (not necessary balls). We study general geometric properties of uniformly convex sets. We also obtain an affirmative solution of the splitting problem for selections of certain set-valued mappings with uniformly convex images.

  8. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    2016-01-01

    We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. When only measurements subject to noise...... of surface tensors are available for reconstruction, we recommend to use certain values of the surface tensors, namely harmonic intrinsic volumes instead of the surface tensors evaluated at the standard basis. The second algorithm we present is based on harmonic intrinsic volumes and allows for noisy...

  9. Reconstruction of convex bodies from surface tensors

    DEFF Research Database (Denmark)

    Kousholt, Astrid; Kiderlen, Markus

    We present two algorithms for reconstruction of the shape of convex bodies in the two-dimensional Euclidean space. The first reconstruction algorithm requires knowledge of the exact surface tensors of a convex body up to rank s for some natural number s. The second algorithm uses harmonic intrinsic...... volumes which are certain values of the surface tensors and allows for noisy measurements. From a generalized version of Wirtinger's inequality, we derive stability results that are utilized to ensure consistency of both reconstruction procedures. Consistency of the reconstruction procedure based...

  10. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...

  11. Convex functions and the rolling circle criterion

    OpenAIRE

    1995-01-01

    Given 0≤R1≤R2≤∞, CVG(R1,R2) denotes the class of normalized convex functions f in the unit disc U, for which ∂f(U) satisfies a Blaschke Rolling Circles Criterion with radii R1 and R2. Necessary and sufficient conditions for R1=R2, growth and distortion theorems for CVG(R1,R2) and rotation theorem for the class of convex functions of bounded type, are found.

  12. A Complete Characterization of the Gap between Convexity and SOS-Convexity

    CERN Document Server

    Ahmadi, Amir Ali

    2011-01-01

    Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials via the definition of convexity, its first order characterization, and its second order characterization are equivalent. These three equivalent algebraic conditions, henceforth referred to as sos-convexity, can be checked by semidefinite programming whereas deciding convexity is NP-hard. If we denote the set of convex and sos-convex polynomials in $n$ variables of degree $d$ with $\\tilde{C}_{n,d}$ and $\\tilde{\\Sigma C}_{n,d}$ respectively, then our main contribution is to prove that $\\tilde{C}_{n,d}=\\tilde{\\Sigma C}_{n,d}$ if and only if $n=1$ or $d=2$ or $(n,d)=(2,4)$. We also present a complete characterization for forms (homogeneous polynomials) except for the case $(n,d)=(3,4)$ which is joint work with G. Blekherman and is to be published elsewhere. Our result states that the set $C_{n,d}$ of convex forms in $n$ variables of degree $d$ equals the set $\\Sigma C_{...

  13. Binary Quadratic Forms: A Historical View

    Science.gov (United States)

    Khosravani, Azar N.; Beintema, Mark B.

    2006-01-01

    We present an expository account of the development of the theory of binary quadratic forms. Beginning with the formulation and proof of the Two-Square Theorem, we show how the study of forms of the type x[squared] + ny[squared] led to the discovery of the Quadratic Reciprocity Law, and how this theorem, along with the concept of reduction relates…

  14. Quadratic Boost A-Source Impedance Network

    DEFF Research Database (Denmark)

    Siwakoti, Yam Prasad; Blaabjerg, Frede; Chub, Andrii

    2016-01-01

    A novel quadratic boost type A-source impedance network is proposed in this paper for realizing converters that demand a very high voltage gain. To achieve that, the proposed network uses an auto-transformer, whose obtained gain is quadratically dependent on the duty ratio and is presently not ma...

  15. Quadratic Boost A-Source Impedance Network

    DEFF Research Database (Denmark)

    Siwakoti, Yam Prasad; Blaabjerg, Frede; Chub, Andrii

    2016-01-01

    A novel quadratic boost A-source impedance network is proposed to realize converters that demand very high voltage gain. To satisfy the requirement, the network uses an autotransformer where the obtained gain is quadratically dependent on the duty ratio and is unmatched by any existing impedance ...

  16. Factorising a Quadratic Expression with Geometric Insights

    Science.gov (United States)

    Joarder, Anwar H.

    2015-01-01

    An algorithm is presented for factorising a quadratic expression to facilitate instruction and learning. It appeals to elementary geometry which may provide better insights to some students or teachers. There have been many methods for factorising a quadratic expression described in school text books. However, students often seem to struggle with…

  17. An example in linear quadratic optimal control

    NARCIS (Netherlands)

    Weiss, George; Zwart, Heiko J.

    1998-01-01

    We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme

  18. An example in linear quadratic optimal control

    NARCIS (Netherlands)

    Weiss, George; Zwart, Heiko J.

    1998-01-01

    We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme sim

  19. Foundations of complex analysis in non locally convex spaces function theory without convexity condition

    CERN Document Server

    Bayoumi, A

    2003-01-01

    All the existing books in Infinite Dimensional Complex Analysis focus on the problems of locally convex spaces. However, the theory without convexity condition is covered for the first time in this book. This shows that we are really working with a new, important and interesting field. Theory of functions and nonlinear analysis problems are widespread in the mathematical modeling of real world systems in a very broad range of applications. During the past three decades many new results from the author have helped to solve multiextreme problems arising from important situations, non-convex and

  20. Quadratic Hedging of Basis Risk

    Directory of Open Access Journals (Sweden)

    Hardy Hulley

    2015-02-01

    Full Text Available This paper examines a simple basis risk model based on correlated geometric Brownian motions. We apply quadratic criteria to minimize basis risk and hedge in an optimal manner. Initially, we derive the Föllmer–Schweizer decomposition for a European claim. This allows pricing and hedging under the minimal martingale measure, corresponding to the local risk-minimizing strategy. Furthermore, since the mean-variance tradeoff process is deterministic in our setup, the minimal martingale- and variance-optimal martingale measures coincide. Consequently, the mean-variance optimal strategy is easily constructed. Simple pricing and hedging formulae for put and call options are derived in terms of the Black–Scholes formula. Due to market incompleteness, these formulae depend on the drift parameters of the processes. By making a further equilibrium assumption, we derive an approximate hedging formula, which does not require knowledge of these parameters. The hedging strategies are tested using Monte Carlo experiments, and are compared with results achieved using a utility maximization approach.

  1. On Quadratic Variation of Martingales

    Indian Academy of Sciences (India)

    Rajeeva L Karandikar; B V Rao

    2014-08-01

    We give a construction of an explicit mapping $$\\Psi: D([0,∞),\\mathbb{R})→ D([0,∞),\\mathbb{R}),$$ where $D([0,∞), \\mathbb{R})$ denotes the class of real valued r.c.l.l. functions on $[0,∞)$ such that for a locally square integrable martingale $(M_t)$ with r.c.l.l. paths, $$\\Psi(M.())=A.()$$ gives the quadratic variation process (written usually as $[M,M]_t$) of $(M_t)$. We also show that this process $(A_t)$ is the unique increasing process $(B_t)$ such that $M_t^2-B_t$ is a local martingale, $B_0=0$ and $$\\mathbb{P}(( B)_t=[( M)_t]^2, 0 < ∞)=1.$$ Apart from elementary properties of martingales, the only result used is the Doob’s maximal inequality. This result can be the starting point of the development of the stochastic integral with respect to r.c.l.l. martingales.

  2. A methodology to ensure local mass conservation for porous media models under finite element formulations based on convex optimization

    Science.gov (United States)

    Chang, J.; Nakshatrala, K.

    2014-12-01

    It is well know that the standard finite element methods, in general, do not satisfy element-wise mass/species balance properties. It is, however, desirable to have element-wide mass balance property in subsurface modeling. Several studies over the years have aimed to overcome this drawback of finite element formulations. Currently, a post-processing optimization-based methodology is commonly employed to recover the local mass balance for porous media models. However, such a post-processing technique does not respect the underlying variational structure that the finite element formulation may enjoy. Motivated by this, a consistent methodology to satisfy element-wise local mass balance for porous media models is constructed using convex optimization techniques. The assembled system of global equations is reconstructed into a quadratic programming problem subjected to bounded equality constraints that ensure conservation at the element level. The proposed methodology can be applied to any computational mesh and to any non-locally conservative nodal-based finite element method. Herein, we integrate our proposed methodology into the framework of the classical mixed Galerkin formulation using Taylor-Hood elements and the least-squares finite element formulation. Our numerical studies will include computational cost, numerical convergence, and comparision with popular methods. In particular, it will be shown that the accuracy of the solutions is comparable with that of several popular locally conservative finite element formulations like the lowest order Raviart-Thomas formulation. We believe the proposed optimization-based approach is a viable approach to preserve local mass balance on general computational grids and is amenable for large-scale parallel implementation.

  3. Tropicalized Lambda Lengths, Measured Laminations and Convexity

    DEFF Research Database (Denmark)

    C. Penner, R.

    cell decomposition of a surface is discovered in the limit. Finally, the tropical analogue of the convex hull construction in Minkowski space is formulated as an explicit algorithm that serially simplifies a triangulation with respect to a fixed lamination and has its own independent applications....

  4. Some Characterizations of Convex Interval Games

    NARCIS (Netherlands)

    Brânzei, R.; Tijs, S.H.; Alparslan-Gok, S.Z.

    2008-01-01

    This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.

  5. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2013-09-19

    Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.

  6. Tropicalized Lambda Lengths, Measured Laminations and Convexity

    DEFF Research Database (Denmark)

    C. Penner, R.

    This work uncovers the tropical analogue for measured laminations of the convex hull construction of decorated Teichmueller theory, namely, it is a study in coordinates of geometric degeneration to a point of Thurston's boundary for Teichmueller space. This may offer a paradigm for the extension...

  7. On fixed points and uniformly convex spaces

    OpenAIRE

    Gelander, Tsachik

    2008-01-01

    The purpose of this note is to present two elementary, but useful, facts concerning actions on uniformly convex spaces. We demonstrate how each of them can be used in an alternative proof of the triviality of the first $L_p$-cohomology of higher rank simple Lie groups, proved in [BFGM].

  8. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

    2007-01-01

    We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

  9. Minimizing convex functions by continuous descent methods

    Directory of Open Access Journals (Sweden)

    Sergiu Aizicovici

    2010-01-01

    Full Text Available We study continuous descent methods for minimizing convex functions, defined on general Banach spaces, which are associated with an appropriate complete metric space of vector fields. We show that there exists an everywhere dense open set in this space of vector fields such that each of its elements generates strongly convergent trajectories.

  10. Differential analysis of matrix convex functions

    DEFF Research Database (Denmark)

    Hansen, Frank; Tomiyama, Jun

    2007-01-01

    We analyze matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [F. Kraus, Über konvekse Matrixfunktionen, Math. Z. 41 (1936) 18-42]. We obtain for each order conditions for ma...

  11. Estimates for oscillatory integrals with convex phase

    Energy Technology Data Exchange (ETDEWEB)

    Chakhkiev, M A [Moscow State Social University, Moscow (Russian Federation)

    2006-02-28

    We consider methods for estimating one-dimensional oscillatory integrals with convex phase and amplitudes of bounded variation or Lipschitz class amplitudes. In particular, we improve the estimate for the Piercey integral with near-caustic parameter values, and also consider estimation methods for n-dimensional oscillatory integrals.

  12. Some Characterizations of Convex Interval Games

    NARCIS (Netherlands)

    Brânzei, R.; Tijs, S.H.; Alparslan-Gok, S.Z.

    2008-01-01

    This paper focuses on new characterizations of convex interval games using the notions of exactness and superadditivity. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of exactness and subadditivity.

  13. Directional Convexity and Finite Optimality Conditions.

    Science.gov (United States)

    1984-03-01

    system, Necessary Conditions for optimality. Work Unit Number 5 (Optimization and Large Scale Systems) *Istituto di Matematica Applicata, Universita...that R(T) is convex would then imply x(u,T) e int R(T). Cletituto di Matematica Applicata, Universita di Padova, 35100 ITALY. Sponsored by the United

  14. Convexity properties of Hamiltonian group actions

    CERN Document Server

    Guillemin, Victor

    2005-01-01

    This is a monograph on convexity properties of moment mappings in symplectic geometry. The fundamental result in this subject is the Kirwan convexity theorem, which describes the image of a moment map in terms of linear inequalities. This theorem bears a close relationship to perplexing old puzzles from linear algebra, such as the Horn problem on sums of Hermitian matrices, on which considerable progress has been made in recent years following a breakthrough by Klyachko. The book presents a simple local model for the moment polytope, valid in the "generic&rdquo case, and an elementary Morse-theoretic argument deriving the Klyachko inequalities and some of their generalizations. It reviews various infinite-dimensional manifestations of moment convexity, such as the Kostant type theorems for orbits of a loop group (due to Atiyah and Pressley) or a symplectomorphism group (due to Bloch, Flaschka and Ratiu). Finally, it gives an account of a new convexity theorem for moment map images of orbits of a Borel sub...

  15. Subset Selection by Local Convex Approximation

    DEFF Research Database (Denmark)

    Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik

    1999-01-01

    least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function...

  16. Conference on Convex Analysis and Global Optimization

    CERN Document Server

    Pardalos, Panos

    2001-01-01

    There has been much recent progress in global optimization algo­ rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun­ damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon­ vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en­ dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...

  17. Relations between Lipschitz functions and convex functions

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    [1]Zajicek, J., On the differentation of convex functions in finite and infinite dimensional spaces, Czech J. Math.,1979, 29: 340-348.[2]Hu, T. C., Klee, V. L., Larman, D. G., Optimization of globally convex functions, SIAM J. Control Optim., 1989,27: 1026-1047.[3]Cepedello Boiso, M., Approximation of Lipschitz functions by △-convex functions in Banach spaces, Israel J.Math., 1998, 106: 269-284.[4]Asplund, E., Frechet differentiability of convex functions, Acta Math., 1968, 121: 31-47.[5]Johnson, J. A., Lipschitz spaces, Pacific J. Math, 1974, 51: 177-186.[6]Stromberg, T., The operation of infimal convolution, Dissert. Math., (Rozprawy Mat.), 1996, 325: 58.[7]Kadison, R. V., Ringrose, J. R., Fundamentals of the theory of operator algebras, volume Ⅰ: Elementary Theory,Graduate Studies in Math., vol. 15, Amer. Math. Soc., 1997.[8]Phelps, R. R., Convex functions,monotone operators and differentiability, Lect. Notes in Math., vol. 1364,Springer-Verlag, 1977.[9]Lindenstrauss, J., On operators which attain their norm, Israel J. Math., 1963, 1: 139-148.[10]Press, D., Gateaux differentiable functions are somewhere Frechet differentiable, Rend. Circ. Mat. Palermo,1984, 33: 122-133.[11]Press, D., Differentiability of Lipschitz functions on Banach spaces, J. Funct. Anal., 1990, 91:312-345.[12]Lindenstrauss, J., Press, D., On Frechet differentiability of Lipschitz maps between Banach spaces, Annals of Math., 2003, 157: 257-288.[13]Press, D., Gateaux differentiable Lipschitz functions need not be Frechet differentiable on a residual set, Supplemento Rend. Circ. Mat. Palermo, Serie Ⅱ, 1982, 2: 217-222.

  18. Fast approximate convex decomposition using relative concavity

    KAUST Repository

    Ghosh, Mukulika

    2013-02-01

    Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

  19. On the convexity of N-Chebyshev sets

    Science.gov (United States)

    Borodin, Petr A.

    2011-10-01

    We define N-Chebyshev sets in a Banach space X for every positive integer N (when N=1, these are ordinary Chebyshev sets) and study conditions that guarantee their convexity. In particular, we prove that all N-Chebyshev sets are convex when N is even and X is uniformly convex or N\\ge 3 is odd and X is smooth uniformly convex.

  20. The Identification of Convex Function on Riemannian Manifold

    Directory of Open Access Journals (Sweden)

    Li Zou

    2014-01-01

    Full Text Available The necessary and sufficient condition of convex function is significant in nonlinear convex programming. This paper presents the identification of convex function on Riemannian manifold by use of Penot generalized directional derivative and the Clarke generalized gradient. This paper also presents a method for judging whether a point is the global minimum point in the inequality constraints. Our objective here is to extend the content and proof the necessary and sufficient condition of convex function to Riemannian manifolds.

  1. ON THE PRODUCT OF GATEAUX DIFFERENTIABILITY LOCALLY CONVEX SPACES

    Institute of Scientific and Technical Information of China (English)

    Shen Xisheng; Cheng Lixin

    2005-01-01

    A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS.

  2. Allometric relationships between traveltime channel networks, convex hulls, and convexity measures

    Science.gov (United States)

    Tay, Lea Tien; Sagar, B. S. Daya; Chuah, Hean Teik

    2006-06-01

    The channel network (S) is a nonconvex set, while its basin [C(S)] is convex. We remove open-end points of the channel connectivity network iteratively to generate a traveltime sequence of networks (Sn). The convex hulls of these traveltime networks provide an interesting topological quantity, which has not been noted thus far. We compute lengths of shrinking traveltime networks L(Sn) and areas of corresponding convex hulls C(Sn), the ratios of which provide convexity measures CM(Sn) of traveltime networks. A statistically significant scaling relationship is found for a model network in the form L(Sn) ˜ A[C(Sn)]0.57. From the plots of the lengths of these traveltime networks and the areas of their corresponding convex hulls as functions of convexity measures, new power law relations are derived. Such relations for a model network are CM(Sn) ˜ ? and CM(Sn) ˜ ?. In addition to the model study, these relations for networks derived from seven subbasins of Cameron Highlands region of Peninsular Malaysia are provided. Further studies are needed on a large number of channel networks of distinct sizes and topologies to understand the relationships of these new exponents with other scaling exponents that define the scaling structure of river networks.

  3. On Quasi E-Convex Bilevel Programming Problem

    Directory of Open Access Journals (Sweden)

    E. A. Youness

    2005-01-01

    Full Text Available Bilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems.

  4. The Pure Virtual Braid Group Is Quadratic

    CERN Document Server

    Lee, Peter

    2011-01-01

    If an augmented algebra K over Q is filtered by powers of its augmentation ideal I, the associated graded algebra gr_I K need not in general be quadratic: although it is generated in degree 1, its relations may not be generated by homogeneous relations of degree 2. In this paper we give a criterion which is equivalent to gr_I K being quadratic. We apply this criterion to the group algebra of the pure virtual braid group (also known as the quasi-triangular group), and show that the corresponding associated graded algebra is quadratic.

  5. Specialization of Quadratic and Symmetric Bilinear Forms

    CERN Document Server

    Knebusch, Manfred

    2010-01-01

    The specialization theory of quadratic and symmetric bilinear forms over fields and the subsequent generic splitting theory of quadratic forms were invented by the author in the mid-1970's. They came to fruition in the ensuing decades and have become an integral part of the geometric methods in quadratic form theory. This book comprehensively covers the specialization and generic splitting theories. These theories, originally developed for fields of characteristic different from 2, are explored here without this restriction. In addition to chapters on specialization theory, generic splitting t

  6. Quadratic stabilization of switched nonlinear systems

    Institute of Scientific and Technical Information of China (English)

    DONG YaLi; FAN JiaoJiao; MEI ShengWei

    2009-01-01

    In this paper, the problem of quadratic stabilization of multi-input multi-output switched nonlinear systems under an arbitrary switching law is investigated. When switched nonlinear systems have uniform normal form and the zero dynamics of uniform normal form is asymptotically stable under an arbitrary switching law, state feedbacks are designed and a common quadratic Lyapunov function of all the closed-loop subsystems is constructed to realize quadratic stabilizability of the class of switched nonlinear systems under an arbitrary switching law. The results of this paper are also applied to switched linear systems.

  7. Sequential Convex Programming for Power Set-point Optimization in a Wind Farm using Black-box Models, Simple Turbine Interactions, and Integer Variables

    DEFF Research Database (Denmark)

    Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Jørgensen, John Bagterp

    2012-01-01

    from the wind farm model, enabling us to use a very simple linear relationship for describing the turbine interactions. In addition, we allow individual turbines to be turned on or off introducing integer variables into the optimization problem. We solve this within the same framework of iterative...... is far superior to, a more naive distribution scheme. We employ a fast convex quadratic programming solver to carry out the iterations in the range of microseconds for even large wind farms....

  8. Statistical Mechanics of Optimal Convex Inference in High Dimensions

    Science.gov (United States)

    Advani, Madhu; Ganguli, Surya

    2016-07-01

    ML and MAP while still outperforming them. For example, such optimal M-estimation algorithms can lead to as much as a 20% reduction in the amount of data to achieve the same performance relative to MAP. Moreover, we demonstrate a prediction of replica theory that no inference procedure whatsoever can outperform our optimal M-estimation procedure when signal and noise distributions are log-concave, by uncovering an equivalence between optimal M-estimation and optimal Bayesian inference in this setting. Our analysis also reveals insights into the nature of generalization and predictive power in high dimensions, information theoretic limits on compressed sensing, phase transitions in quadratic inference, and connections to central mathematical objects in convex optimization theory and random matrix theory.

  9. A Comparison of Multi-Parametric Programming, Mixed-Integer Programming, Gradient Descent Based, and the Embedding Approach on Four Published Hybrid Optimal Control Examples

    CERN Document Server

    Meyer, Richard; DeCarlo, Raymond A

    2012-01-01

    This paper compares the embedding approach for solving hybrid optimal control problems to multi-parameter programming, mixed-integer programming, and gradient-descent based methods in the context of four published examples. The four examples include a spring-mass system, moving-target tracking for a mobile robot, two-tank filling, and a DC-DC boost converter. Numerical advantages of the embedding approach are set forth and validated for each example: significantly faster solution time, no ad hoc assumptions (such as predetermined mode sequences) or control models, lower performance index costs, and algorithm convergence when other methods fail. Specific (theoretical) advantages of the embedding approach over the other methods are also described: guaranteed existence of a solution under mild conditions, convexity of the embedded optimization problem solvable with traditional techniques such as sequential quadratic programming with no need for any mixed-integer programming, applicability to nonlinear systems, e...

  10. A Generalization of Uniformly Extremely Convex Banach Spaces

    OpenAIRE

    Suyalatu Wulede; Wurichaihu Bai; Wurina Bao

    2016-01-01

    We discuss a new class of Banach spaces which are the generalization of uniformly extremely convex spaces introduced by Wulede and Ha. We prove that the new class of Banach spaces lies strictly between either the classes of k-uniformly rotund spaces and k-strongly convex spaces or classes of fully k-convex spaces and k-strongly convex spaces and has no inclusive relation with the class of locally k-uniformly convex spaces. We obtain in addition some characterizations and properties of this ne...

  11. Structure of Solvable Quadratic Lie Algebras

    Institute of Scientific and Technical Information of China (English)

    ZHU Lin-sheng

    2005-01-01

    @@ Killing form plays a key role in the theory of semisimple Lie algebras. It is natural to extend the study to Lie algebras with a nondegenerate symmetric invariant bilinear form. Such a Lie algebra is generally called a quadratic Lie algebra which occur naturally in physics[10,12,13]. Besides semisimple Lie algebras, interesting quadratic Lie algebras include the Kac-Moody algebras and the Extended Affine Lie algebras.

  12. Compression limits in cascaded quadratic soliton compression

    DEFF Research Database (Denmark)

    Bache, Morten; Bang, Ole; Krolikowski, Wieslaw;

    2008-01-01

    Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency.......Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency....

  13. Radiotherapy treatment planning linear-quadratic radiobiology

    CERN Document Server

    Chapman, J Donald

    2015-01-01

    Understand Quantitative Radiobiology from a Radiation Biophysics PerspectiveIn the field of radiobiology, the linear-quadratic (LQ) equation has become the standard for defining radiation-induced cell killing. Radiotherapy Treatment Planning: Linear-Quadratic Radiobiology describes tumor cell inactivation from a radiation physics perspective and offers appropriate LQ parameters for modeling tumor and normal tissue responses.Explore the Latest Cell Killing Numbers for Defining Iso-Effective Cancer TreatmentsThe book compil

  14. Quadratic stabilization for uncertain stochastic systems

    Institute of Scientific and Technical Information of China (English)

    Jun'e FENG; Weihai ZHANG

    2005-01-01

    This paper discusses the robust quadratic stabilization control problem for stochastic uncertain systems,where the uncertain matrix is norm bounded,and the external disturbance is a stochastic process.Two kinds of controllers are designed,which include state feedback case and output feedback case.The conditions for the robust quadratic stabilization of stochastic uncertain systems are given via linear matrix inequalities.The detailed design methods are presented.Numerical examples show the effectiveness of our results.

  15. Cascaded quadratic soliton compression at 800 nm

    DEFF Research Database (Denmark)

    Bache, Morten; Bang, Ole; Moses, Jeffrey;

    2007-01-01

    We study soliton compression in quadratic nonlinear materials at 800 nm, where group-velocity mismatch dominates. We develop a nonlocal theory showing that efficient compression depends strongly on characteristic nonlocal time scales related to pulse dispersion.......We study soliton compression in quadratic nonlinear materials at 800 nm, where group-velocity mismatch dominates. We develop a nonlocal theory showing that efficient compression depends strongly on characteristic nonlocal time scales related to pulse dispersion....

  16. A NEW INEXACT SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    倪勤

    2002-01-01

    This paper represents an inexact sequential quadratic programming (SQP ) algorithm which can solve nonlinear programming (NLP ) problems. An inexact solution of the quadratic programming subproblem is determined by a projection and contraction method such that only matrix-vector product is required. Some truncated criteria are chosen such that the algorithm is suitable to large scale NLP problem. The global convergence of the algorithm is proved.

  17. An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application.

    Science.gov (United States)

    Hu, Xiaolin; Wang, Jun

    2008-12-01

    This paper presents a novel recurrent neural network for solving a class of convex quadratic programming (QP) problems, in which the quadratic term in the objective function is the square of the Euclidean norm of the variable. This special structure leads to a set of simple optimality conditions for the problem, based on which the neural network model is formulated. Compared with existing neural networks for general convex QP, the new model is simpler in structure and easier to implement. The new model can be regarded as an improved version of the dual neural network in the literature. Based on the new model, a simple neural network capable of solving the k-winners-take-all ( k-WTA) problem is formulated. The stability and global convergence of the proposed neural network is proved rigorously and substantiated by simulation results.

  18. The explicit dependence of quadrat variance on the ratio of clump size to quadrat size.

    Science.gov (United States)

    Ferrandino, Francis J

    2005-05-01

    ABSTRACT In the past decade, it has become common practice to pool mapped binary epidemic data into quadrats. The resultant "quadrat counts" can then be analyzed by fitting them to a probability distribution (i.e., betabinomial). Often a binary form of Taylor's power law is used to relate the quadrat variance to the quadrat mean. The fact that there is an intrinsic dependence of such analyses on quadrat size and shape is well known. However, a clear-cut exposition of the direct connection between the spatial properties of the two-dimensional pattern of infected plants in terms of the geometry of the quadrat and the results of quadrat-based analyses is lacking. This problem was examined both empirically and analytically. The empirical approach is based on a set of stochastically generated "mock epidemics" using a Neyman-Scott cluster process. The resultant spatial point-patterns of infected plants have a fixed number of disease foci characterized by a known length scale (monodisperse) and saturated to a known disease level. When quadrat samples of these epidemics are fit to a beta-binomial distribution, the resulting measures of aggregation are totally independent of disease incidence and most strongly dependent on the ratio of the length scale of the quadrat to the length scale of spatial aggregation and to a lesser degree on disease saturation within individual foci. For the analytical approach, the mathematical form for the variation in the sum of random variates is coupled to the geometry of a quadrat through an assumed exponential autocorrelation function. The net result is an explicit equation expressing the intraquadrat correlation, quadrat variance, and the index of dispersion in terms of the ratio of the quadrat length scale to the correlative length scale.

  19. The heart of a convex body

    CERN Document Server

    Brasco, Lorenzo

    2012-01-01

    We investigate some basic properties of the {\\it heart} $\\heartsuit(\\mathcal{K})$ of a convex set $\\mathcal{K}.$ It is a subset of $\\mathcal{K},$ whose definition is based on mirror reflections of euclidean space, and is a non-local object. The main motivation of our interest for $\\heartsuit(\\mathcal{K})$ is that this gives an estimate of the location of the hot spot in a convex heat conductor with boundary temperature grounded at zero. Here, we investigate on the relation between $\\heartsuit(\\mathcal{K})$ and the mirror symmetries of $\\mathcal{K};$ we show that $\\heartsuit(\\mathcal{K})$ contains many (geometrically and phisically) relevant points of $\\mathcal{K};$ we prove a simple geometrical lower estimate for the diameter of $\\heartsuit(\\mathcal{K});$ we also prove an upper estimate for the area of $\\heartsuit(\\mathcal{K}),$ when $\\mathcal{K}$ is a triangle.

  20. Coalescence between two convex liquid surfaces

    Science.gov (United States)

    Yang, Fan; Jian, Zhen; Li, Erqiang; Thoroddsen, S. T.

    2015-11-01

    We study the coalescence of two convex surfaces of the same liquid. One of the convex free surfaces is formed at a circular opening of a closed tank by imposing a negative pressure difference. The other surface is a droplet of larger curvature, which is pendant from a concentric nozzle. The coalescence starts from near-zero velocity, so the configuration can be characterized by two dimensionless numbers: the Ohnesorge number Oh = μ /√{ ργL } and the radius ratio between the two surfaces α =rd /rs . We use high-speed video, PIV and numerical simulations, using the Gerris program, to study the dynamics of the coalescence. Our focus is on the interface shapes, the growth-rate of the neck connecting the two surfaces and the formation of a vortex ring. The growth-rate is compared to earlier models for the coalescence of drops or bubbles.

  1. Convex Modeling of Interactions with Strong Heredity

    Science.gov (United States)

    Haris, Asad; Witten, Daniela; Simon, Noah

    2015-01-01

    We consider the task of fitting a regression model involving interactions among a potentially large set of covariates, in which we wish to enforce strong heredity. We propose FAMILY, a very general framework for this task. Our proposal is a generalization of several existing methods, such as VANISH [Radchenko and James, 2010], hierNet [Bien et al., 2013], the all-pairs lasso, and the lasso using only main effects. It can be formulated as the solution to a convex optimization problem, which we solve using an efficient alternating directions method of multipliers (ADMM) algorithm. This algorithm has guaranteed convergence to the global optimum, can be easily specialized to any convex penalty function of interest, and allows for a straightforward extension to the setting of generalized linear models. We derive an unbiased estimator of the degrees of freedom of FAMILY, and explore its performance in a simulation study and on an HIV sequence data set. PMID:28316461

  2. Convex Arrhenius plots and their interpretation

    Science.gov (United States)

    Truhlar, Donald G.; Kohen, Amnon

    2001-01-01

    This paper draws attention to selected experiments on enzyme-catalyzed reactions that show convex Arrhenius plots, which are very rare, and points out that Tolman's interpretation of the activation energy places a fundamental model-independent constraint on any detailed explanation of these reactions. The analysis presented here shows that in such systems, the rate coefficient as a function of energy is not just increasing more slowly than expected, it is actually decreasing. This interpretation of the data provides a constraint on proposed microscopic models, i.e., it requires that any successful model of a reaction with a convex Arrhenius plot should be consistent with the microcanonical rate coefficient being a decreasing function of energy. The implications and limitations of this analysis to interpreting enzyme mechanisms are discussed. This model-independent conclusion has broad applicability to all fields of kinetics, and we also draw attention to an analogy with diffusion in metastable fluids and glasses. PMID:11158559

  3. On the convexity of Relativistic Hydrodynamics

    CERN Document Server

    Ibáñez, José María; Martí, José María; Miralles, Juan Antonio; 10.1088/0264-9381/30/5/057002

    2013-01-01

    The relativistic hydrodynamic system of equations for a perfect fluid obeying a causal equation of state is hyperbolic (Anile 1989 {\\it Relativistic Fluids and Magneto-Fluids} (Cambridge: Cambridge University Press)). In this report, we derive the conditions for this system to be convex in terms of the fundamental derivative of the equation of state (Menikoff and Plohr 1989 {\\it Rev. Mod. Phys.} {\\bf 61} 75). The classical limit is recovered.

  4. Coefficient inequalities for starlikeness and convexity

    Directory of Open Access Journals (Sweden)

    Ali Rosihan M.

    2013-06-01

    Full Text Available For an analytic function $f(z=z+\\sum_{n=2}^\\infty a_n z^n$ satisfying the inequality $\\sum_{n=2}^\\infty n(n-1|a_n|\\leq \\beta$, sharp bound on $\\beta$ is determined so that $f$ is either starlike or convex of order $\\alpha$. Several other coefficient inequalities related to certain subclasses are also investigated.

  5. When is multidimensional screening a convex program?

    CERN Document Server

    Figalli, Alessio; McCann, Robert J

    2009-01-01

    A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis and that agents can choose only pure strategies, we identify a structural condition on the preference b(x,y) of agent type x for product type y -- and on the principal's costs c(y) -- which is necessary and sufficient for reducing the profit maximization problem faced by the principal to a convex program. This is a key step toward making the principal's problem theoretically and computationally tractable; in particular, it allows us to derive uniqueness and stability of the principal's optimum strategy -- and similarly of the strategy maximizing the expected welfare of the agents when the principal's profitability is constrained. We call this condition non-negative cross-curvature: it is also (i) necessary and sufficient to guarantee convexity of the set of b-convex functions, (ii) invariant under r...

  6. Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

    Science.gov (United States)

    2016-10-11

    formulates many online resource allocation and revenue management problems is the online linear program (0-1-ILP) in which the constraint matrix is...column is revealed without observing the future inputs and the goal is to maximize the overall objective function. In this paper, we provide a near

  7. Linear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions

    Science.gov (United States)

    Tanemura, M.; Chida, Y.

    2016-09-01

    There are a lot of design problems of control system which are expressed as a performance index minimization under BMI conditions. However, a minimization problem expressed as LMIs can be easily solved because of the convex property of LMIs. Therefore, many researchers have been studying transforming a variety of control design problems into convex minimization problems expressed as LMIs. This paper proposes an LMI method for a quadratic performance index minimization problem with a class of BMI conditions. The minimization problem treated in this paper includes design problems of state-feedback gain for switched system and so on. The effectiveness of the proposed method is verified through a state-feedback gain design for switched systems and a numerical simulation using the designed feedback gains.

  8. Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

    DEFF Research Database (Denmark)

    Mak, Vicky; Thomadsen, Tommy

    2006-01-01

    This paper considers the cardinality constrained quadratic knapsack problem (QKP) and the quadratic selective travelling salesman problem (QSTSP). The QKP is a generalization of the knapsack problem and the QSTSP is a generalization of the travelling salesman problem. Thus, both problems are NP...

  9. Linear-quadratic control and quadratic differential forms for multidimensional behaviors

    NARCIS (Netherlands)

    Napp, D.; Trentelman, H.L.

    2011-01-01

    This paper deals with systems described by constant coefficient linear partial differential equations (nD-systems) from a behavioral point of view. In this context we treat the linear-quadratic control problem where the performance functional is the integral of a quadratic differential form. We look

  10. CXFTV2: A Fortran subroutine for the discrete least squares convex approximation

    Science.gov (United States)

    Demetriou, I. C.

    1997-03-01

    A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O( n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software.

  11. Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity

    Science.gov (United States)

    Demetriou, I. C.

    2002-09-01

    Methods are presented for least squares data smoothing by using the signs of divided differences of the smoothed values. Professor M.J.D. Powell initiated the subject in the early 1980s and since then, theory, algorithms and FORTRAN software make it applicable to several disciplines in various ways. Let us consider n data measurements of a univariate function which have been altered by random errors. Then it is usual for the divided differences of the measurements to show sign alterations, which are probably due to data errors. We make the least sum of squares change to the measurements, by requiring the sequence of divided differences of order m to have at most q sign changes for some prescribed integer q. The positions of the sign changes are integer variables of the optimization calculation, which implies a combinatorial problem whose solution can require about O(nq) quadratic programming calculations in n variables and n-m constraints. Suitable methods have been developed for the following cases. It has been found that a dynamic programming procedure can calculate the global minimum for the important cases of piecewise monotonicity m=1,q[greater-or-equal, slanted]1 and piecewise convexity/concavity m=2,q[greater-or-equal, slanted]1 of the smoothed values. The complexity of the procedure in the case of m=1 is O(n2+qn log2 n) computer operations, while it is reduced to only O(n) when q=0 (monotonicity) and q=1 (increasing/decreasing monotonicity). The case m=2,q[greater-or-equal, slanted]1 requires O(qn2) computer operations and n2 quadratic programming calculations, which is reduced to one and n-2 quadratic programming calculations when m=2,q=0, i.e. convexity, and m=2,q=1, i.e. convexity/concavity, respectively. Unfortunately, the technique that receives this efficiency cannot generalize for the highly nonlinear case m[greater-or-equal, slanted]3,q[greater-or-equal, slanted]2. However, the case m[greater-or-equal, slanted]3,q=0 is solved by a special strictly

  12. Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization

    Indian Academy of Sciences (India)

    DEEPAK KUMAR; A G RAMAKRISHNAN

    2016-03-01

    Particle swarm optimization (PSO) is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The central idea is to use PSO to move in the direction towards optimal solution rather than searching the entire feasibleregion. Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method. Each class in the binary classification problem is modeled as a multidimensional ellipsoid to forma quadratic constraint in the problem. Particle swarms help in determining the optimal hyperplane or classification boundary for a data set. Our results on the Iris, Pima, Wine, Thyroid, Balance, Bupa, Haberman, and TAE datasets show that the proposed method works better than a neural network and the performance is close to that of a support vector machine

  13. 使用广义几何规划导出带二次约束的二次规划和交互熵问题%Quadratical Constrained Quadratic Programs and Cross-Entropy Problems Via Generalized Geometric Programming

    Institute of Scientific and Technical Information of China (English)

    朱德通

    2002-01-01

    A minimization problem of either a convex quadratic function or a minimum cross-entropy problem with a set of quadratical inequality constraints is considered.Based on the properties of the generalized geometric programming,the dual programs of two problems are derived.The duality theorems and related Kuhn-Tucker conditions for two pairs of the primal-dual programs are also established by using the duality theory.%研究带二次约束的最小二次规划和交互熵问题.基于广义几何规划的理论与性质,导出了上述两个规划原问题的对偶规划.进而,由广义几何规划的对偶理论建立了两个原始一对偶规划的对偶定理和Kuhn-Tucker条件.

  14. Fast approximate quadratic programming for graph matching.

    Directory of Open Access Journals (Sweden)

    Joshua T Vogelstein

    Full Text Available Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs, we find that it efficiently achieves performance.

  15. Fast approximate quadratic programming for graph matching.

    Science.gov (United States)

    Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.

  16. Quadratic Interpolation Algorithm for Minimizing Tabulated Function

    Directory of Open Access Journals (Sweden)

    E. A. Youness

    2008-01-01

    Full Text Available Problem statement: The problem of finding the minimum value of objective function, when we know only some values of it, is needed in more practical fields. Quadratic interpolation algorithms are the famous tools deal with this kind of these problems. These algorithms interested with the polynomial space in which the objective function is approximated. Approach: In this study we approximated the objective function by a one dimensional quadratic polynomial. This approach saved the time and the effort to get the best point at which the objective is minimized. Results: The quadratic polynomial in each one of the steps of the proposed algorithm, accelerate the convergent to the best value of the objective function without taking into account all points of the interpolation set. Conclusion: Any n-dimensional problem of finding a minimal value of a function, given by some values, can be converted to one dimensional problem easier in deal.

  17. Quadratic gravity: from weak to strong

    CERN Document Server

    Holdom, Bob

    2016-01-01

    More than three decades ago quadratic gravity was found to present a perturbative, renormalizable and asymptotically free theory of quantum gravity. Unfortunately the theory appeared to have problems with a spin-2 ghost. In this essay we revisit quadratic gravity in a different light by considering the case that the asymptotically free interaction flows to a strongly interacting regime. This occurs when the coefficient of the Einstein-Hilbert term is smaller than the scale $\\Lambda_{\\mathrm{QG}}$ where the quadratic couplings grow strong. Here QCD provides some useful insights. By pushing the analogy with QCD, we conjecture that the nonperturbative effects can remove the naive spin-2 ghost and lead to the emergence of general relativity in the IR.

  18. A Mean Point Based Convex Hull Computation Algorithm

    Directory of Open Access Journals (Sweden)

    Digvijay Singh

    2016-11-01

    Full Text Available The optimal solution of a Linear Programming problem (LPP is a basic feasible solution and all basic feasible solutions are extreme or boundary points of a convex region formed by the constraint functions of the LPP. In fact, the feasible solution space is not always a convex set so the verification of extreme points for optimality is quite difficult. In order to cover the non-convex feasible points within a convex set, a convex hull is imagined so that the extreme or boundary points may be checked for evaluation of the optimum solution in the decision-making process. In this article a computer assisted convex hull computation algorithm using the Mean Point and Python code verified results of the designed algorithm are discussed.

  19. Convex functions and optimization methods on Riemannian manifolds

    CERN Document Server

    Udrişte, Constantin

    1994-01-01

    This unique monograph discusses the interaction between Riemannian geometry, convex programming, numerical analysis, dynamical systems and mathematical modelling. The book is the first account of the development of this subject as it emerged at the beginning of the 'seventies. A unified theory of convexity of functions, dynamical systems and optimization methods on Riemannian manifolds is also presented. Topics covered include geodesics and completeness of Riemannian manifolds, variations of the p-energy of a curve and Jacobi fields, convex programs on Riemannian manifolds, geometrical constructions of convex functions, flows and energies, applications of convexity, descent algorithms on Riemannian manifolds, TC and TP programs for calculations and plots, all allowing the user to explore and experiment interactively with real life problems in the language of Riemannian geometry. An appendix is devoted to convexity and completeness in Finsler manifolds. For students and researchers in such diverse fields as pu...

  20. On the modulus of U-convexity

    Directory of Open Access Journals (Sweden)

    Satit Saejung

    2005-01-01

    Full Text Available We prove that the moduli of U-convexity, introduced by Gao (1995, of the ultrapower X˜ of a Banach space X and of X itself coincide whenever X is super-reflexive. As a consequence, some known results have been proved and improved. More precisely, we prove that uX(1>0 implies that both X and the dual space X∗ of X have uniform normal structure and hence the “worth” property in Corollary 7 of Mazcuñán-Navarro (2003 can be discarded.

  1. Convex and Radially Concave Contoured Distributions

    Directory of Open Access Journals (Sweden)

    Wolf-Dieter Richter

    2015-01-01

    Full Text Available Integral representations of the locally defined star-generalized surface content measures on star spheres are derived for boundary spheres of balls being convex or radially concave with respect to a fan in Rn. As a result, the general geometric measure representation of star-shaped probability distributions and the general stochastic representation of the corresponding random vectors allow additional specific interpretations in the two mentioned cases. Applications to estimating and testing hypotheses on scaling parameters are presented, and two-dimensional sample clouds are simulated.

  2. Width Distributions for Convex Regular Polyhedra

    CERN Document Server

    Finch, Steven R

    2011-01-01

    The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the regular tetrahedron and the cube. Higher-order moments of f_tetra and f_cube have not been examined until now. Assume that each polyhedron has edges of unit length. We deduce that the mean square width of the regular tetrahedron is 1/3+(3+sqrt(3))/(3*pi) and the mean square width of the cube is 1+4/pi.

  3. Measuring Voting Power in Convex Policy Spaces

    Directory of Open Access Journals (Sweden)

    Sascha Kurz

    2014-03-01

    Full Text Available Classical power index analysis considers the individual’s ability to influence the aggregated group decision by changing its own vote, where all decisions and votes are assumed to be binary. In many practical applications we have more options than either “yes” or “no”. Here we generalize three important power indices to continuous convex policy spaces. This allows the analysis of a collection of economic problems like, e.g., tax rates or spending that otherwise would not be covered in binary models.

  4. The Wiener maximum quadratic assignment problem

    CERN Document Server

    Cela, Eranda; Woeginger, Gerhard J

    2011-01-01

    We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the literature.

  5. A CART extention using Quadratic Decision Borders

    DEFF Research Database (Denmark)

    Hartelius, Karsten

    1999-01-01

    In this article we put forward an extention to the hierarchical CART classification method which uses quadratic decision borders. The original CART applies univariate splits on individual variables as well as splits on combinations of variables to recursively partition the feature......-space into subsets which are successively more class-homogeneous. Guided by the fact that class-distributions in feature-space are very often hyper-elliptical shaped, we give an extension to the original CART which also uses quadratic shaped decision borders which can be modelled by a mean-vector and a dispersion...

  6. A CART extension using Quadratic Decision Borders

    DEFF Research Database (Denmark)

    Hartelius, Karsten

    1999-01-01

    In this article we put forward an extention to the hierarchical CART classification method which uses quadratic decision borders. The original CART applies univariate splits on individual variables as well as splits on combinations of variables to recursively partition the feature......-space into subsets which are successively more class-homogeneous. Guided by the fact that class-distributions in feature-space are very often hyper-elliptical shaped, we give an extension to the original CART which also uses quadratic shaped decision borders which can be modelled by a mean-vector and a dispersion...

  7. PSQP: Puzzle Solving by Quadratic Programming.

    Science.gov (United States)

    Andalo, Fernanda A; Taubin, Gabriel; Goldenstein, Siome

    2017-02-01

    In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.

  8. Quintessence with quadratic coupling to dark matter

    CERN Document Server

    Boehmer, Christian G; Chan, Nyein; Lazkoz, Ruth; Maartens, Roy

    2009-01-01

    We introduce a new form of coupling between dark energy and dark matter that is quadratic in their energy densities. Then we investigate the background dynamics when dark energy is in the form of exponential quintessence. The three types of quadratic coupling all admit late-time accelerating critical points, but these are not scaling solutions. We also show that two types of coupling allow for a suitable matter era at early times and acceleration at late times, while the third type of coupling does not admit a suitable matter era.

  9. Guises and disguises of quadratic divergences

    Energy Technology Data Exchange (ETDEWEB)

    Cherchiglia, A.L., E-mail: adriano@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Vieira, A.R., E-mail: arvieira@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Hiller, Brigitte, E-mail: brigitte@teor.fis.uc.pt [Departamento de Física, Faculdade de Ciências e Tecnologia, Universidade de Coimbra, 3004-516 Coimbra (Portugal); Baêta Scarpelli, A.P., E-mail: scarpelli.apbs@dpf.gov.br [Setor Técnico-Científico, Departamento de Polícia Federal, Rua Hugo D’Antola, 95 - Lapa, São Paulo (Brazil); Sampaio, Marcos, E-mail: marcos.sampaio@durham.ac.uk [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Centre for Particle Theory, Department of Mathematical Sciences, Durham University, South Road Durham DH1 3LE (United Kingdom)

    2014-12-15

    In this contribution, we present a new perspective on the control of quadratic divergences in quantum field theory, in general, and in the Higgs naturalness problem, in particular. Our discussion is essentially based on an approach where UV divergences are parameterized, after being reduced to basic divergent integrals (BDI) in one internal momentum, as functions of a cutoff and a renormalization group scale λ. We illustrate our proposal with well-known examples, such as the gluon vacuum self energy of QCD and the Higgs decay in two photons within this approach. We also discuss frameworks in effective low-energy QCD models, where quadratic divergences are indeed fundamental.

  10. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2004-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda...... on the simple observation that all functions in each component need the same extra parameters and thus a transitive closure is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity...

  11. Lambda-lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, O.; Schultz, U.P.

    2004-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda...... on the simple observation that all functions in each component need the same extra parameters and thus a transitive closure is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity...

  12. On orthogonality preserving quadratic stochastic operators

    Energy Technology Data Exchange (ETDEWEB)

    Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd [Department of Computational and Theoretical Sciences, Faculty of Science International Islamic University Malaysia, P.O. Box 141, 25710 Kuantan, Pahang Malaysia (Malaysia)

    2015-05-15

    A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.

  13. Discrete fractional Radon transforms and quadratic forms

    CERN Document Server

    Pierce, Lillian B

    2010-01-01

    We consider discrete analogues of fractional Radon transforms involving integration over paraboloids defined by positive definite quadratic forms. We prove sharp results for this class of discrete operators in all dimensions, providing necessary and sufficient conditions for them to extend to bounded operators from $\\ell^p$ to $\\ell^q$. The method involves an intricate spectral decomposition according to major and minor arcs, motivated by ideas from the circle method of Hardy and Littlewood. Techniques from harmonic analysis, in particular Fourier transform methods and oscillatory integrals, as well as the number theoretic structure of quadratic forms, exponential sums, and theta functions, play key roles in the proof.

  14. Trace-Inequalities and Matrix-Convex Functions

    Directory of Open Access Journals (Sweden)

    Ando Tsuyoshi

    2010-01-01

    Full Text Available Abstract A real-valued continuous function on an interval gives rise to a map via functional calculus from the convex set of Hermitian matrices all of whose eigenvalues belong to the interval. Since the subpace of Hermitian matrices is provided with the order structure induced by the cone of positive semidefinite matrices, one can consider convexity of this map. We will characterize its convexity by the following trace-inequalities: for . A related topic will be also discussed.

  15. Recovery of Sparse Probability Measures via Convex Programming

    OpenAIRE

    Pilanci, Mert; El Ghaoui, Laurent; Chandrasekaran, Venkat

    2012-01-01

    We consider the problem of cardinality penalized optimization of a convex function over the probability simplex with additional convex constraints. The classical ℓ_1 regularizer fails to promote sparsity on the probability simplex since ℓ_1 norm on the probability simplex is trivially constant. We propose a direct relaxation of the minimum cardinality problem and show that it can be efficiently solved using convex programming. As a first application we consider recovering a spa...

  16. Lower Bound for Convex Hull Area and Universal Cover Problems

    CERN Document Server

    Khandhawit, Tirasan; Sriswasdi, Sira

    2011-01-01

    In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a unit length curve has area at least 0.232239. In addition, we show that a convex universal cover for a unit closed curve has area at least 0.0879873.

  17. Measurement of Nonadiabatic Effects in Ultracold Molecules via Anomalous Linear and Quadratic Zeeman Shifts

    CERN Document Server

    McGuyer, B H; McDonald, M; Reinaudi, G; Skomorowski, W; Moszynski, R; Zelevinsky, T

    2013-01-01

    Anomalously large linear and quadratic Zeeman shifts are measured for weakly bound ultracold $^{88}$Sr$_2$ molecules near the intercombination line asymptote. Nonadiabatic Coriolis coupling and the nature of long-range molecular potentials explain how this effect arises and scales roughly cubically with the size of the molecule. The linear shifts yield nonadiabatic mixing angles of the molecular states. The quadratic shifts are sensitive to fourth-order contributions and to nearby opposite $f$-parity states, and provide a stringent test of a state-of-the-art ab initio model.

  18. Estimating the Quadratic Variation Spectrum of Noisy Asset Prices Using Generalized Flat-top Realized Kernels

    DEFF Research Database (Denmark)

    Varneskov, Rasmus T.

    2014-01-01

    This paper analyzes a generalized class of flat-top realized kernels for estimation ot the quadratic variation spectrum,i.e. the decomposition of quadratic variation into integrated variance and jump variation, when the underlying, efficient price process is contaminated by addictive noise......-top estimators are shown to be consistent, asymptotically unbiased, and mixed Gaussian at the optimal rate of convergence, n1/4. Exact bound on lower order terms are obtained using maximal inequalities and these are used to derive a conservative, MSE-optimal flat-top shrinkage. Additionally, bounds...

  19. Approximation of Convex Bodies by Convex Bodies%凸体间的逼近

    Institute of Scientific and Technical Information of China (English)

    国起; Sten Kaijser

    2003-01-01

    For the affine distance d(C,D)between two convex bodies C,D(∈)Rn,which reduces to the Banach-Mazur distance for symmetric convex bodies, the bounds of d(C,D)have been studied for many years. Some well known estimates for the upper-bounds are as follows: F. John proved d(C,D)≤n1/2 if one is an ellipsoid and another is symmetric,d(C,D)≤n if both are symmetric, and fromF. John's result and d(C1,C2)≤d(C1,C3)d(C2,C3) one has d(C,D)≤n2 for general convex bodies;M.Lassak proved d(C,D)≤(2n-1) if one of them is symmetric.In this paper we get an estimate which includes all the results above as special cases and refines some of them in terms of measures of asymmetry for convex bodies.

  20. 关于二次规划问题的一个新算法%A NEW ALGORITHM FOR QUADRATIC PROGRAMMING PROBLEM

    Institute of Scientific and Technical Information of China (English)

    邵先喜

    2001-01-01

    用线性的方法研究一个二次规划的算法问题。对于一般的二次规划的算法常导致极端Kuhn-Tucker点被改变成一些有限点问题后,严格的凸二次规划总是就有限收敛了。%A quadratic programming algorithm was presented with Armijo's line search.For general quadratic programming,the algorithm either converges to a Kuhn-Tucker point of problem in finite steps,or generates infinite point sequence such that any finite cluster point is the Kuhn-Tucker point of problem.For strictly convex quadratic programming,the algorithm has finite convergence.

  1. Error bound results for convex inequality systems via conjugate duality

    CERN Document Server

    Bot, Radu Ioan

    2010-01-01

    The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via one convex inequality and extend the achieved results, by making use of a celebrated scalarization function, to convex inequality systems expressed by means of a general vector function. We also propose a second approach for guaranteeing the existence of global error bounds of the latter, which meanwhile sharpens the classical result of Robinson.

  2. Long Wave Dynamics along a Convex Bottom

    CERN Document Server

    Didenkulova, Ira; Soomere, Tarmo

    2008-01-01

    Long linear wave transformation in the basin of varying depth is studied for a case of a convex bottom profile in the framework of one-dimensional shallow water equation. The existence of travelling wave solutions in this geometry and the uniqueness of this wave class is established through construction of a 1:1 transformation of the general 1D wave equation to the analogous wave equation with constant coefficients. The general solution of the Cauchy problem consists of two travelling waves propagating in opposite directions. It is found that generally a zone of a weak current is formed between these two waves. Waves are reflected from the coastline so that their profile is inverted with respect to the calm water surface. Long wave runup on a beach with this profile is studied for sine pulse, KdV soliton and N-wave. Shown is that in certain cases the runup height along the convex profile is considerably larger than for beaches with a linear slope. The analysis of wave reflection from the bottom containing a s...

  3. Molecular Graphics of Convex Body Fluids.

    Science.gov (United States)

    Gabriel, Adrian T; Meyer, Timm; Germano, Guido

    2008-03-01

    Coarse-grained modeling of molecular fluids is often based on nonspherical convex rigid bodies like ellipsoids or spherocylinders representing rodlike or platelike molecules or groups of atoms, with site-site interaction potentials depending both on the distance among the particles and the relative orientation. In this category of potentials, the Gay-Berne family has been studied most extensively. However, conventional molecular graphics programs are not designed to visualize such objects. Usually the basic units are atoms displayed as spheres or as vertices in a graph. Atomic aggregates can be highlighted through an increasing amount of stylized representations, e.g., Richardson ribbon diagrams for the secondary structure of proteins, Connolly molecular surfaces, density maps, etc., but ellipsoids and spherocylinders are generally missing, especially as elementary simulation units. We fill this gap providing and discussing a customized OpenGL-based program for the interactive, rendered representation of large ensembles of convex bodies, useful especially in liquid crystal research. We pay particular attention to the performance issues for typical system sizes in this field. The code is distributed as open source.

  4. Test-assignment: a quadratic coloring problem

    NARCIS (Netherlands)

    Duives, Jelle; Lodi, Andrea; Malaguti, Enrico

    2013-01-01

    We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods bas

  5. Experimental results on quadratic assignment problem

    Directory of Open Access Journals (Sweden)

    N.P. Nikolov

    1999-08-01

    Full Text Available The paper presents experimental results on quadratic assignment problem. The "scanning area" method formulated for radioelectronic equipment design is applied. For all more complex tests ours results are better or coincident with the ones known in literature. Conclusion concerning the effectiveness of method are given.

  6. Quadratic Forms%二次型

    Institute of Scientific and Technical Information of China (English)

    谭亚茹

    2016-01-01

    The quadratic Higher Algebra is an important part of this paper, the definition of quadratic forms, introduces the second type of representation, and then describes how to use the allocation method, elementary transformation, orthogonal transformation method, etc. II second type into the standard form, and the second type of normal form, finally introduced posi-tive definite quadratic form and method for determining positive definite quadratic form.%二次型是高等代数的重要组成部分,本文从二次型的定义出发,介绍了二次型的表示方法,然后介绍了如何用配方法、初等变换法、正交变换法等将二次型化为标准形,以及二次型的规范形,最后介绍了正定二次型和判定正定二次型的方法。

  7. On Quadratic Programming with a Ratio Objective

    CERN Document Server

    Bhaskara, Aditya; Manokaran, Rajsekar; Vijayaraghavan, Aravindan

    2011-01-01

    Quadratic Programming (QP) is the well-studied problem of maximizing over {-1,1} values the quadratic form \\sum_ij a_ij x_i x_j. QP captures many known combinatorial optimization problems and SDP techniques have given optimal approximation algorithms for many of these problems. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain {-1,0,1}. The specific problem we study is: QP-Ratio: max_{-1,0,1}^n (x^T A x) / (x^T x). This objective function is a natural relative of several well studied problems. Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the {-1,1} and {0,1} domains do not seem to carry over to the {-1,0,1} domain. We give approximation algorithms and evidence for the hardness of approximating the QP-Ratio problem. We consider an SDP relaxation obtained by adding constraints to the natural SDP relaxation for this problem and obtain an O(n^{2/7}) algorithm for...

  8. Distortion control of conjugacies between quadratic polynomials

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    We use a new type of distortion control of univalent functions to give an alternative proof of Douady-Hubbard’s ray-landing theorem for quadratic Misiurewicz polynomials. The univalent maps arise from Thurston’s iterated algorithm on perturbation of such polynomials.

  9. Target manifold formation using a quadratic SDF

    Science.gov (United States)

    Hester, Charles F.; Risko, Kelly K. D.

    2013-05-01

    Synthetic Discriminant Function (SDF) formulation of correlation filters provides constraints for forming target subspaces for a target set. In this paper we extend the SDF formulation to include quadratic constraints and use this solution to form nonlinear manifolds in the target space. The theory for forming these manifolds will be developed and demonstrated with data.

  10. The GCD property and irreduciable quadratic polynomials

    Directory of Open Access Journals (Sweden)

    Saroj Malik

    1986-01-01

    Full Text Available The proof of the following theorem is presented: If D is, respectively, a Krull domain, a Dedekind domain, or a Prüfer domain, then D is correspondingly a UFD, a PID, or a Bezout domain if and only if every irreducible quadratic polynomial in D[X] is a prime element.

  11. Modulational instability in periodic quadratic nonlinear materials

    DEFF Research Database (Denmark)

    Corney, Joel Frederick; Bang, Ole

    2001-01-01

    We investigate the modulational instability of plane waves in quadratic nonlinear materials with linear and nonlinear quasi-phase-matching gratings. Exact Floquet calculations, confirmed by numerical simulations, show that the periodicity can drastically alter the gain spectrum but never complete...

  12. Integration of the Quadratic Function and Generalization

    Science.gov (United States)

    Mitsuma, Kunio

    2011-01-01

    We will first recall useful formulas in integration that simplify the calculation of certain definite integrals with the quadratic function. A main formula relies only on the coefficients of the function. We will then explore a geometric proof of one of these formulas. Finally, we will extend the formulas to more general cases. (Contains 3…

  13. Solitons in quadratic nonlinear photonic crystals

    DEFF Research Database (Denmark)

    Corney, Joel Frederick; Bang, Ole

    2001-01-01

    We study solitons in one-dimensional quadratic nonlinear photonic crystals with modulation of both the linear and nonlinear susceptibilities. We derive averaged equations that include induced cubic nonlinearities, which can be defocusing, and we numerically find previously unknown soliton families...

  14. Range-based estimation of quadratic variation

    DEFF Research Database (Denmark)

    Christensen, Kim; Podolskij, Mark

    In this paper, we propose using realized range-based estimation to draw inference about the quadratic variation of jump-diffusion processes. We also construct a new test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the test...

  15. Range-based estimation of quadratic variation

    DEFF Research Database (Denmark)

    Christensen, Kim; Podolskij, Mark

    This paper proposes using realized range-based estimators to draw inference about the quadratic variation of jump-diffusion processes. We also construct a range-based test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient...

  16. ML-MG: Multi-label Learning with Missing Labels Using a Mixed Graph

    KAUST Repository

    Wu, Baoyuan

    2015-12-07

    This work focuses on the problem of multi-label learning with missing labels (MLML), which aims to label each test instance with multiple class labels given training instances that have an incomplete/partial set of these labels (i.e. some of their labels are missing). To handle missing labels, we propose a unified model of label dependencies by constructing a mixed graph, which jointly incorporates (i) instance-level similarity and class co-occurrence as undirected edges and (ii) semantic label hierarchy as directed edges. Unlike most MLML methods, We formulate this learning problem transductively as a convex quadratic matrix optimization problem that encourages training label consistency and encodes both types of label dependencies (i.e. undirected and directed edges) using quadratic terms and hard linear constraints. The alternating direction method of multipliers (ADMM) can be used to exactly and efficiently solve this problem. To evaluate our proposed method, we consider two popular applications (image and video annotation), where the label hierarchy can be derived from Wordnet. Experimental results show that our method achieves a significant improvement over state-of-the-art methods in performance and robustness to missing labels.

  17. Multi-Quadratic Dynamic Programming Procedure of - Preserving Denoising for Medical Images

    Science.gov (United States)

    Pham, C. T.; Kopylov, A. V.

    2015-05-01

    In this paper, we present a computationally efficient technique for edge preserving in medical image smoothing, which is developed on the basis of dynamic programming multi-quadratic procedure. Additionally, we propose a new non-convex type of pair-wise potential functions, allow more flexibility to set a priori preferences, using different penalties for various ranges of differences between the values of adjacent image elements. The procedure of image analysis, based on the new data models, significantly expands the class of applied problems, and can take into account the presence of heterogeneities and discontinuities in the source data, while retaining high computational efficiency of the dynamic programming procedure and Kalman filterinterpolator. Comparative study shows, that our algorithm has high accuracy to speed ratio, especially in the case of high-resolution medical images.

  18. 一类凸二次规划的新算法%Algorithm for a Kind of Convex Quadratic Programming

    Institute of Scientific and Technical Information of China (English)

    曹玉梅; 徐裕生

    2006-01-01

    本文给出了求解一类凸二次规划问题的新算法.这种算法既保留了传统算法的优点,又避免了其它算法中出现的添加人工变量过多、循环等问题.算例表明,这种算法是简便而有效的.

  19. 严格凸二次规划的Cholesky预处理%The Preconditioning of Strict Convex Quadratic Programming

    Institute of Scientific and Technical Information of China (English)

    于绍慧; 李启伟

    2006-01-01

    文章主要讨论了严格凸二次规划的求解,结合Cholesky分解思想,对严格凸二次规划问题进行了预处理,并且通过数值试验对预处理前后的二次规划的求解进行了比较,数值实验取得了较好的效果

  20. Interior Point Approach for Convex Quadratic Programming%凸二次规划问题的内点算法

    Institute of Scientific and Technical Information of China (English)

    阮喜珍

    2003-01-01

    提出了一类利用对数障碍函数法求解凸二次规划问题的内点算法,此算法在每次迭代中只需解一个等式约束的二次规划问题(或线性方程组系统),结构简单,易于计算,最后运用数值仿真测试验证了此方法的有效性.

  1. Convexity-preserving Bernstein–Bézier quartic scheme

    Directory of Open Access Journals (Sweden)

    Maria Hussain

    2014-07-01

    Full Text Available A C1 convex surface data interpolation scheme is presented to preserve the shape of scattered data arranged over a triangular grid. Bernstein–Bézier quartic function is used for interpolation. Lower bound of the boundary and inner Bézier ordinates is determined to guarantee convexity of surface. The developed scheme is flexible and involves more relaxed constraints.

  2. Finding sets of points without empty convex 6-gons

    NARCIS (Netherlands)

    Overmars, M.H.

    2001-01-01

    Erdös asked whether every large enough set of points in general position in the plane contains six points that form a convex 6-gon without any points from the set in its interior. In this note we show how a set of 29 points was found that contains no empty convex 6-gon. To this end a fast

  3. Convex bodies in Euclidean and Weil-Petersson geometries

    CERN Document Server

    Yamada, Sumio

    2011-01-01

    On a convex body in a Euclidean space, we introduce a new variational formulation for its Funk metric, a Finsler metric compatible with the tautological Finsler structure of the convex body. We generalize the metric on Teichmuller spaces with the Weil-Petersson distance function. A set of similarities the resulting metric structure shares with Thurston's asymmetric metric is noted.

  4. Convergence of Algorithms for Reconstructing Convex Bodies and Directional Measures

    DEFF Research Database (Denmark)

    Gardner, Richard; Kiderlen, Markus; Milanfar, Peyman

    2006-01-01

    We investigate algorithms for reconstructing a convex body K in Rn from noisy measurements of its support function or its brightness function in k directions u1, . . . , uk. The key idea of these algorithms is to construct a convex polytope Pk whose support function (or brightness function) best ...

  5. In-vivo Convex Array Vector Flow Imaging

    DEFF Research Database (Denmark)

    Jensen, Jørgen Arendt; Brandt, Andreas Hjelm; Nielsen, Michael Bachmann

    2014-01-01

    In-vivo VFI scans obtained from the abdomen of a human volunteer using a convex array transducers and trans- verse oscillation vector flow imaging (VFI) are presented. A 3 MHz BK Medical 8820e (Herlev, Denmark) 192-element convex array probe is used with the SARUS experimental ultrasound scanner....

  6. Locally uniformly convex norms in Banach spaces and their duals

    OpenAIRE

    Haydon, Richard

    2006-01-01

    It is shown that a Banach space with locally uniformly convex dual admits an equivalent norm which is itself locally uniformly convex. It follows that on any such space all continuous real-valued functions may be uniformly approximated by C^1 functions.

  7. On a-order-convexity of Fuzzy Syntopogenous Spaces

    Institute of Scientific and Technical Information of China (English)

    WANG Hong

    2007-01-01

    In this paper,we combine L-fuzzy syntopogenous structure on X with algebraic structure on X.First,the *-increasing and *-decreasing spaces have been studied.Second,we define a-order-convexity on syntopogenous structures (X,S,≤).some important properties of a-order-convexity have been obtained.

  8. Transverse-Mode Control of VCSELs With Convex Mirror

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    We propose the transverse-mode control of vertical-cavity surface-emitting lasers (VCSELs) with a convex mirror. A possibility of improvements on single-mode output power and higher-order mode suppression is presented by optimizing a convex mirror.

  9. Infinitesimal nonrigidity of convex surfaces with planar boundary

    Institute of Scientific and Technical Information of China (English)

    LI Chunhe; HONG Jiaxing

    2005-01-01

    In the present paper infinitesimal nonrigidity of a class of convex surfaces with planar boundary is given. This result shows that if the image of the Gauss map of an evolution convex surface with planar boundary covers some hemisphere, this surface may be of infinitesimal nonrigidity for the isometric deformation of planar boundary.

  10. Homotopy Method for Non-convex Programming in Unbonded Set

    Institute of Scientific and Technical Information of China (English)

    徐庆; 于波

    2005-01-01

    In the past few years, much and much attention has been paid to the method for solving non-convex programming. Many convergence results are obtained for bounded sets. In this paper, we get global convergence results for non-convex programming in unbounded sets under suitable conditions.

  11. (Average-) convexity of common pool and oligopoly TU-games

    NARCIS (Netherlands)

    Driessen, T.S.H.; Meinhardt, H.

    2000-01-01

    The paper studies both the convexity and average-convexity properties for a particular class of cooperative TU-games called common pool games. The common pool situation involves a cost function as well as a (weakly decreasing) average joint production function. Firstly, it is shown that, if the rele

  12. Simple sufficient conditions for starlikeness and convexity for meromorphic functions

    Directory of Open Access Journals (Sweden)

    Goswami Pranay

    2016-01-01

    Full Text Available In this paper we investigate some extensions of sufficient conditions for meromorphic multivalent functions in the open unit disk to be meromorphic multivalent starlike and convex of order α. Our results unify and extend some starlikeness and convexity conditions for meromorphic multivalent functions obtained by Xu et al. [2], and some interesting special cases are given.

  13. The inverse moment problem for convex polytopes

    CERN Document Server

    Gravin, Nick; Pasechnik, Dmitrii; Robins, Sinai

    2011-01-01

    The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we show that the vertices of an N-vertex polytope in R^d can be reconstructed from the knowledge of O(DN) axial moments (w.r.t. to an unknown polynomial measure od degree D) in d+1 distinct generic directions. Our approach is based on the collection of moment formulas due to Brion, Lawrence, Khovanskii-Pukhikov, and Barvinok that arise in the discrete geometry of polytopes, and what variously known as Prony's method, or Vandermonde factorization of finite rank Hankel matrices.

  14. Convex functions, monotone operators and differentiability

    CERN Document Server

    Phelps, Robert R

    1989-01-01

    These notes start with an introduction to the differentiability of convex functions on Banach spaces, leading to the study of Asplund spaces and their intriguing relationship to monotone operators (and more general set-values maps) and Banach spaces with the Radon-Nikodym property. While much of this is classical, some of it is presented using streamlined proofs which were not available until recently. Considerable attention is paid to contemporary results on variational principles and perturbed optimization in Banach spaces, exhibiting their close connections with Asplund spaces. An introductory course in functional analysis is adequate background for reading these notes which can serve as the basis for a seminar of a one-term graduate course. There are numerous excercises, many of which form an integral part of the exposition.

  15. non-Lipschitzian mappings without convexity

    Directory of Open Access Journals (Sweden)

    G. Li

    1999-01-01

    real Hilbert space H, and ℑ={Tt:t∈G} a representation of G as asymptotically nonexpansive type mappings of C into itself. Let L(x={z∈H:infs∈Gsupt∈G‖Tts x−z‖=inft∈G‖Tt x−z‖} for each x∈C and L(ℑ=∩x∈C L(x. In this paper, we prove that ∩s∈Gconv¯{Tts x:t∈G}∩L(ℑ is nonempty for each x∈C if and only if there exists a unique nonexpansive retraction P of C into L(ℑ such that PTs=P for all s∈G and P(x∈conv¯{Ts x:s∈G} for every x∈C. Moreover, we prove the ergodic convergence theorem for a semitopological semigroup of non-Lipschitzian mappings without convexity.

  16. DIFFERENTIAL SUBORDINATIONS AND α-CONVEX FUNCTIONS

    Institute of Scientific and Technical Information of China (English)

    Jacek DZIOK; Ravinder Krishna RAINA; Janusz SOK(O)L

    2013-01-01

    This article presents some new results on the class SLMα of functions that are analytic in the open unit discu ={z:[z[< 1} satisfying the conditions that f(0)=0,f'(0)=1,and α (1+ zf"(z)/f'(z)) + (1-α)zf'(z)/f(x) ∈(p)(u)for all z ∈ u,where α is a real number and (p)(z) =1 + τ2z2/ 1-τz-τ2z2 (z ∈ u).The number τ =(1-√5)/2 is such that τ2 =1 + T.The class SLMα introduced by J.Dziok,R.K.Raina,and J.Sokól [3,Appl.Math.Comput.218 (2011),996-1002] is closely related to the classes of starlike and convex functions.The article deals with several ideas and techniques used in geometric function theory and differential subordinations theory.

  17. Quantification of small, convex particles by TEM

    Energy Technology Data Exchange (ETDEWEB)

    Andersen, Sigmund J. [SINTEF Materials and Chemistry, Department of Synthesis and Properties, Material Physics, NO-7465 Trondheim (Norway)], E-mail: sigmund.j.andersen@sintef.no; Holme, Borge [SINTEF Materials and Chemistry, P.O. Box 124, Blindern, NO-0314 Oslo (Norway); Marioara, Calin D. [SINTEF Materials and Chemistry, Department of Synthesis and Properties, Material Physics, NO-7465 Trondheim (Norway)

    2008-07-15

    It is shown how size distributions of arbitrarily oriented, convex, non-overlapping particles extracted from conventional transmission electron microscopy (TEM) images may be determined by a variation of the Schwartz-Saltykov method. In TEM, particles cut at the surfaces have diminished projections, which alter the observed size distribution. We represent this distribution as a vector and multiply it with the inverse of a matrix comprising thickness-dependent Scheil or Schwartz-Saltykov terms. The result is a corrected size distribution of the projections of uncut particles. It is shown how the real (3D) distribution may be estimated when particle shape is considered. Computer code to generate the matrix is given. A log-normal distribution of spheres and a real distribution of pill-box-shaped dispersoids in an Al-Mg-Si alloy are given as examples. The errors are discussed in detail.

  18. Weighted composition operators and locally convex algebras

    Institute of Scientific and Technical Information of China (English)

    Edoardo Vesentini

    2005-01-01

    The Gleason-Kahane-Zelazko theorem characterizes the continuous homomorphism of an associative, locally multiplicatively convex, sequentially complete algebra A into the field C among all linear forms on A. This characterization will be applied along two different directions. In the case in which A is a commutative Banach algebra, the theorem yields the representation of some classes of continuous linear maps A: A → A as weighted composition operators, or as composition operators when A is a continuous algebra endomorphism. The theorem will then be applied to explore the behaviour of continuous linear forms on quasi-regular elements, when A is either the algebra of all Hilbert-Schmidt operators or a Hilbert algebra.

  19. The problem of convexity of Chebyshev sets

    Science.gov (United States)

    Balaganskii, V. S.; Vlasov, L. P.

    1996-12-01

    Contents Introduction §1. Definitions and notation §2. Reference theorems §3. Some results Chapter I. Characterization of Banach spaces by means of the relations between approximation properties of sets §1. Existence, uniqueness §2. Prom approximate compactness to 'sun'-property §3. From 'sun'-property to approximate compactness §4. Differentiability in the direction of the gradient is sufficient for Fréchet and Gâteaux differentiability §5. Sets with convex complement Chapter II. The structure of Chebyshev and related sets §1. The isolated point method §2. Restrictions of the type \\vert\\overline{W}\\vert Klee (discrete Chebyshev set) §4. A survey of some other results Conclusion Bibliography

  20. Convex Decomposition Based Cluster Labeling Method for Support Vector Clustering

    Institute of Scientific and Technical Information of China (English)

    Yuan Ping; Ying-Jie Tian; Ya-Jian Zhou; Yi-Xian Yang

    2012-01-01

    Support vector clustering (SVC) is an important boundary-based clustering algorithm in multiple applications for its capability of handling arbitrary cluster shapes. However,SVC's popularity is degraded by its highly intensive time complexity and poor label performance.To overcome such problems,we present a novel efficient and robust convex decomposition based cluster labeling (CDCL) method based on the topological property of dataset.The CDCL decomposes the implicit cluster into convex hulls and each one is comprised by a subset of support vectors (SVs).According to a robust algorithm applied in the nearest neighboring convex hulls,the adjacency matrix of convex hulls is built up for finding the connected components; and the remaining data points would be assigned the label of the nearest convex hull appropriately.The approach's validation is guaranteed by geometric proofs.Time complexity analysis and comparative experiments suggest that CDCL improves both the efficiency and clustering quality significantly.

  1. ANALYSIS TO NEYMAN-PEARSON CLASSIFICATION WITH CONVEX LOSS FUNCTION

    Institute of Scientific and Technical Information of China (English)

    Min Han; Dirong Chen; Zhaoxu Sun

    2008-01-01

    Neyman-Pearson classification has been studied in several articles before.But they all proceeded in the classes of indicator functions with indicator function as the loss function,which make the calculation to be difficult.This paper investigates NeymanPearson classification with convex loss function in the arbitrary class of real measurable functions.A general condition is given under which Neyman-Pearson classification with convex loss function has the same classifier as that with indicator loss function.We give analysis to NP-ERM with convex loss function and prove it's performance guarantees.An example of complexity penalty pair about convex loss function risk in terms of Rademacher averages is studied,which produces a tight PAC bound of the NP-ERM with convex loss function.

  2. Introducing convex layers to the Traveling Salesman Problem

    CERN Document Server

    Liew, Sing

    2012-01-01

    In this paper, we will propose convex layers to the Traveling Salesman Problem (TSP). Firstly, we will focus on human performance on the TSP. Experimental data shows that untrained humans appear to have the ability to perform well in the TSP. On the other hand, experimental data also supports the hypothesis of convex hull i.e. human relies on convex hull to search for the optimal tour for the TSP. Secondly, from the paper published by Bonabeau, Dorigo and Theraulaz, social insect behavior would be able to help in some of the optimizing problems, especially the TSP. Thus, we propose convex layers to the TSP based on the argument that, by the analogy to the social insect behavior, untrained humans' cognition should be able to help in the TSP. Lastly, we will use Tour Improvement algorithms on convex layers to search for an optimal tour for a 13-cities problem to demonstrate the idea.

  3. Efficient protocols for point-convex hull inclusion decision problems

    Directory of Open Access Journals (Sweden)

    Yun Ye

    2010-05-01

    Full Text Available Secure Multi-party Computation (SMC is dedicated to solve trust problems in cooperative computing with each participant’s private data. Privacy Preserving Computational Geometry (PPCG is a special area in SMC and being widely researched. In the real world, PPCG theories can be found being used in various occasions such as military cooperation, commercial competitions and so on. Point-convex hull inclusion problem is a practical case in PPCG and has its profound values. This paper firstly investigates the point inclusion problem with static convex hull, and then marches on to the cases of active convex hull, including the parallel moving and rotating ones. To solve the problems above, we propose a secure protocol to determine the relative position of a private point and a private convex hull in the first place. Compared with previous solutions, our protocols perform better in efficiency, especially when the number of the convex hull’s point is large.

  4. Misunderstanding that the Effective Action is Convex under Broken Symmetry

    CERN Document Server

    Asanuma, Nobu-Hiko

    2016-01-01

    The widespread belief that the effective action is convex and has a flat bottom under broken global symmetry is shown to be wrong. We show spontaneous symmetry breaking necessarily accompanies non-convexity in the effective action for quantum field theory, or in the free energy for statistical mechanics, and clarify the magnitude of non-convexity. For quantum field theory, it is also explicitly proved that translational invariance breaks spontaneously when the system is in the non-convex region, and that different vacua of spontaneously broken symmetry cannot be superposed. As applications of non-convexity, we study the first-order phase transition which happens at the zero field limit of spontaneously broken symmetry, and we propose a simple model of phase coexistence which obeys the Born rule.

  5. CPU timing routines for a CONVEX C220 computer system

    Science.gov (United States)

    Bynum, Mary Ann

    1989-01-01

    The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

  6. Fundamentals of convex analysis duality, separation, representation, and resolution

    CERN Document Server

    Panik, Michael J

    1993-01-01

    Fundamentals of Convex Analysis offers an in-depth look at some of the fundamental themes covered within an area of mathematical analysis called convex analysis. In particular, it explores the topics of duality, separation, representation, and resolution. The work is intended for students of economics, management science, engineering, and mathematics who need exposure to the mathematical foundations of matrix games, optimization, and general equilibrium analysis. It is written at the advanced undergraduate to beginning graduate level and the only formal preparation required is some familiarity with set operations and with linear algebra and matrix theory. Fundamentals of Convex Analysis is self-contained in that a brief review of the essentials of these tool areas is provided in Chapter 1. Chapter exercises are also provided. Topics covered include: convex sets and their properties; separation and support theorems; theorems of the alternative; convex cones; dual homogeneous systems; basic solutions and comple...

  7. Geometric Approaches to Quadratic Equations from Other Times and Places.

    Science.gov (United States)

    Allaire, Patricia R.; Bradley, Robert E.

    2001-01-01

    Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

  8. On quadratic residue codes and hyperelliptic curves

    Directory of Open Access Journals (Sweden)

    David Joyner

    2008-01-01

    Full Text Available For an odd prime p and each non-empty subset S⊂GF(p, consider the hyperelliptic curve X S defined by y 2 =f S (x, where f S (x = ∏ a∈S (x-a. Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p, this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S⊂GF(p for which the bound |X S (GF(p| > 1.39p holds. We also use the quasi-quadratic residue codes defined below to construct an example of a formally self-dual optimal code whose zeta function does not satisfy the ``Riemann hypothesis.''

  9. Higgsed Stueckelberg vector and Higgs quadratic divergence

    Directory of Open Access Journals (Sweden)

    Durmuş Ali Demir

    2015-01-01

    Full Text Available Here we show that, a hidden vector field whose gauge invariance is ensured by a Stueckelberg scalar and whose mass is spontaneously generated by the Standard Model Higgs field contributes to quadratic divergences in the Higgs boson mass squared, and even leads to its cancellation at one-loop when Higgs coupling to gauge field is fine-tuned. In contrast to mechanisms based on hidden scalars where a complete cancellation cannot be achieved, stabilization here is complete in that the hidden vector and the accompanying Stueckelberg scalar are both free from quadratic divergences at one-loop. This stability, deriving from hidden exact gauge invariance, can have important implications for modeling dark phenomena like dark matter, dark energy, dark photon and neutrino masses. The hidden fields can be produced at the LHC.

  10. Linear quadratic output tracking and disturbance rejection

    Science.gov (United States)

    Karimi-Ghartemani, Masoud; Khajehoddin, S. Ali; Jain, Praveen; Bakhshai, Alireza

    2011-08-01

    This article introduces the problem of linear quadratic tracking (LQT) where the objective is to design a closed-loop control scheme such that the output signal of the system optimally tracks a given reference signal and rejects a given disturbance. Different performance indices that have been used to address the tracking problem are discussed and an appropriate new form is introduced. It is shown that a solution to the proposed optimality index exists under very mild conditions of stabilisability and detectability of the plant state-space equations. The solution is formulated based on converting the LQT problem to a standard linear quadratic regulation problem. The method is applied to two examples, a first-order plant and a third-order plant, and their simulation results are presented and discussed.

  11. Estimating quadratic variation using realized variance

    DEFF Research Database (Denmark)

    Barndorff-Nielsen, Ole Eiler; Shephard, N.

    2002-01-01

    This paper looks at some recent work on estimating quadratic variation using realized variance (RV) - that is, sums of M squared returns. This econometrics has been motivated by the advent of the common availability of high-frequency financial return data. When the underlying process is a semimar......This paper looks at some recent work on estimating quadratic variation using realized variance (RV) - that is, sums of M squared returns. This econometrics has been motivated by the advent of the common availability of high-frequency financial return data. When the underlying process...... have to impose some weak regularity assumptions. We illustrate the use of the limit theory on some exchange rate data and some stock data. We show that even with large values of M the RV is sometimes a quite noisy estimator of integrated variance. Copyright © 2002 John Wiley & Sons, Ltd....

  12. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2002-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  13. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2004-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  14. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2003-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  15. Lambda-lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, O.; Schultz, U.P.

    2004-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  16. Quaternion orders, quadratic forms, and Shimura curves

    CERN Document Server

    Alsina, Montserrat

    2004-01-01

    Shimura curves are a far-reaching generalization of the classical modular curves. They lie at the crossroads of many areas, including complex analysis, hyperbolic geometry, algebraic geometry, algebra, and arithmetic. The text provides an introduction to the subject from a theoretic and algorithmic perspective. The main topics covered in it are Shimura curves defined over the rational number field, the construction of their fundamental domains, and the determination of their complex multiplication points. The study of complex multiplication points in Shimura curves leads to the study of families of binary quadratic forms with algebraic coefficients and to their classification by arithmetic Fuchsian groups. In this regard, the authors develop a theory full of new possibilities which parallels Gauss' theory on the classification of binary quadratic forms with integral coefficients by the action of the modular group. Each topic covered in the book begins with a theoretical discussion followed by carefully worked...

  17. Elementary Components of the Quadratic Assignment Problem

    CERN Document Server

    Chicano, Francisco; Alba, Enrique

    2011-01-01

    The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.

  18. Cubic Lienard Equations with Quadratic Damping (Ⅱ)

    Institute of Scientific and Technical Information of China (English)

    Yu-quan Wang; Zhu-jun Jing

    2002-01-01

    Applying Hopf bifurcation theory and qualitative theory, we show that the general cubic Lienard equations with quadratic damping have at most three limit cycles. This implies that the guess in which the system has at most two limit cycles is false. We give the sufficient conditions for the system has at most three limit cycles or two limit cycles. We present two examples with three limit cycles or two limit cycles by using numerical simulation.

  19. Characterization of a Quadratic Function in Rn

    Science.gov (United States)

    Xu, Conway

    2010-01-01

    It is proved that a scalar-valued function "f"(x) defined in "n"-dimensional space must be quadratic, if the intersection of tangent planes at x[subscript 1] and x[subscript 2] always contains the midpoint of the line joining x[subscript 1] and x[subscript 2]. This is the converse of a result of Stenlund proved in this JOURNAL in 2001.

  20. Quadratic forms representing all odd positive integers

    CERN Document Server

    Rouse, Jeremy

    2011-01-01

    We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19 of those represent all positive odds. (Jagy later dealt with a 20th candidate.) Assuming that the remaining three forms represent all positive odds, we prove that an arbitrary, positive-definite quadratic form represents all positive odds if and only if it represents the odd numbers from 1 up to 451. This result is analogous to Bhargava and Hanke's celebrated 290-theorem. In addition, we prove that these three remaining ternaries represent all positive odd integers, assuming the generalized Riemann hypothesis. This result is made possible by a new analytic method for bounding the cusp constants of integer-valued quaternary quadratic forms $Q$ with fundamental discriminant. This method is based on the analytic properties of Rankin-Selberg $L$-functions, and we use it to prove...

  1. Optimal Approximation of Quadratic Interval Functions

    Science.gov (United States)

    Koshelev, Misha; Taillibert, Patrick

    1997-01-01

    Measurements are never absolutely accurate, as a result, after each measurement, we do not get the exact value of the measured quantity; at best, we get an interval of its possible values, For dynamically changing quantities x, the additional problem is that we cannot measure them continuously; we can only measure them at certain discrete moments of time t(sub 1), t(sub 2), ... If we know that the value x(t(sub j)) at a moment t(sub j) of the last measurement was in the interval [x-(t(sub j)), x + (t(sub j))], and if we know the upper bound D on the rate with which x changes, then, for any given moment of time t, we can conclude that x(t) belongs to the interval [x-(t(sub j)) - D (t - t(sub j)), x + (t(sub j)) + D (t - t(sub j))]. This interval changes linearly with time, an is, therefore, called a linear interval function. When we process these intervals, we get an expression that is quadratic and higher order w.r.t. time t, Such "quadratic" intervals are difficult to process and therefore, it is necessary to approximate them by linear ones. In this paper, we describe an algorithm that gives the optimal approximation of quadratic interval functions by linear ones.

  2. Semi-Huber Quadratic Function and Comparative Study of Some MRFs for Bayesian Image Restoration

    Science.gov (United States)

    De la Rosa, J. I.; Villa-Hernández, J.; González-Ramírez, E.; De la Rosa, M. E.; Gutiérrez, O.; Olvera-Olvera, C.; Castañeda-Miranda, R.; Fleury, G.

    2013-10-01

    The present work introduces an alternative method to deal with digital image restoration into a Bayesian framework, particularly, the use of a new half-quadratic function is proposed which performance is satisfactory compared with respect to some other functions in existing literature. The bayesian methodology is based on the prior knowledge of some information that allows an efficient modelling of the image acquisition process. The edge preservation of objects into the image while smoothing noise is necessary in an adequate model. Thus, we use a convexity criteria given by a semi-Huber function to obtain adequate weighting of the cost functions (half-quadratic) to be minimized. The principal objective when using Bayesian methods based on the Markov Random Fields (MRF) in the context of image processing is to eliminate those effects caused by the excessive smoothness on the reconstruction process of image which are rich in contours or edges. A comparison between the new introduced scheme and other three existing schemes, for the cases of noise filtering and image deblurring, is presented. This collection of implemented methods is inspired of course on the use of MRFs such as the semi-Huber, the generalized Gaussian, the Welch, and Tukey potential functions with granularity control. The obtained results showed a satisfactory performance and the effectiveness of the proposed estimator with respect to other three estimators.

  3. Decomposability of Abstract and Path-Induced Convexities in Hypergraphs

    Directory of Open Access Journals (Sweden)

    Malvestuto Francesco Mario

    2015-08-01

    Full Text Available An abstract convexity space on a connected hypergraph H with vertex set V (H is a family C of subsets of V (H (to be called the convex sets of H such that: (i C contains the empty set and V (H, (ii C is closed under intersection, and (iii every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by X and are not separated by any convex set that is a proper subset of X. A nonempty subset X of V (H is a cluster of H if in H every two vertices in X are not separated by any convex set. The cluster hypergraph of H is the hypergraph with vertex set V (H whose edges are the maximal clusters of H. A convexity space on H is called decomposable if it satisfies the following three properties:

  4. Estimating the Quadratic Variation Spectrum of Noisy Asset Prices Using Generalized Flat-top Realized Kernels

    DEFF Research Database (Denmark)

    Varneskov, Rasmus T.

    2014-01-01

    This paper analyzes a generalized class of flat-top realized kernels for estimation ot the quadratic variation spectrum,i.e. the decomposition of quadratic variation into integrated variance and jump variation, when the underlying, efficient price process is contaminated by addictive noise....... The additive noise consists of two orthogonal components, which allows for a-mixing dependent exogenous noise and an asymptoticaly non-degenerate endogenous correlation structure, respectively. Both components may exhibit polynomially decaying autocovariances. In the absence of jumps, the class of flat......-top estimators are shown to be consistent, asymptotically unbiased, and mixed Gaussian at the optimal rate of convergence, n1/4. Exact bound on lower order terms are obtained using maximal inequalities and these are used to derive a conservative, MSE-optimal flat-top shrinkage. Additionally, bounds...

  5. Exploiting Symmetry in Integer Convex Optimization using Core Points

    CERN Document Server

    Herr, Katrin; Schürmann, Achill

    2012-01-01

    We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. We define a core point of such a symmetry group as an integral point for which the convex hull of its orbit does not contain integral points other than the orbit points themselves. These core points allow us to decompose symmetric integer convex programming problems. Especially for symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the art commercial solvers and solve an open MIPLIB problem.

  6. Properties of distance functions on convex surfaces and Alexandrov spaces

    CERN Document Server

    Rataj, Jan

    2009-01-01

    If $X$ is a convex surface in a Euclidean space, then the squared (intrinsic) distance function $\\dist^2(x,y)$ is d.c. (DC, delta-convex) on $X\\times X$ in the only natural extrinsic sense. For the proof we use semiconcavity (in an intrinsic sense) of $\\dist^2(x,y)$ on $X \\times X$ if $X$ is an Alexandrov space with nonnegative curvature. Applications concerning $r$-boundaries (distance spheres) and the ambiguous locus (exoskeleton) of a closed subset of a convex surface are given.

  7. Plane geometry and convexity of polynomial stability regions

    CERN Document Server

    Henrion, Didier

    2008-01-01

    The set of controllers stabilizing a linear system is generally non-convex in the parameter space. In the case of two-parameter controller design (e.g. PI control or static output feedback with one input and two outputs), we observe however that quite often for benchmark problem instances, the set of stabilizing controllers seems to be convex. In this note we use elementary techniques from real algebraic geometry (resultants and Bezoutian matrices) to explain this phenomenon. As a byproduct, we derive a convex linear matrix inequality (LMI) formulation of two-parameter fixed-order controller design problem, when possible.

  8. Bubbles, convexity and the Black--Scholes equation

    CERN Document Server

    Ekström, Erik; 10.1214/08-AAP579

    2009-01-01

    A bubble is characterized by the presence of an underlying asset whose discounted price process is a strict local martingale under the pricing measure. In such markets, many standard results from option pricing theory do not hold, and in this paper we address some of these issues. In particular, we derive existence and uniqueness results for the Black--Scholes equation, and we provide convexity theory for option pricing and derive related ordering results with respect to volatility. We show that American options are convexity preserving, whereas European options preserve concavity for general payoffs and convexity only for bounded contracts.

  9. Shape preserving rational cubic spline for positive and convex data

    Directory of Open Access Journals (Sweden)

    Malik Zawwar Hussain

    2011-11-01

    Full Text Available In this paper, the problem of shape preserving C2 rational cubic spline has been proposed. The shapes of the positive and convex data are under discussion of the proposed spline solutions. A C2 rational cubic function with two families of free parameters has been introduced to attain the C2 positive curves from positive data and C2 convex curves from convex data. Simple data dependent constraints are derived on free parameters in the description of rational cubic function to obtain the desired shape of the data. The rational cubic schemes have unique representations.

  10. A Note on The Convexity of Chebyshev Sets

    Directory of Open Access Journals (Sweden)

    Sangeeta

    2009-07-01

    Full Text Available Perhaps one of the major unsolved problem in Approximation Theoryis: Whether or not every Chebyshev subset of a Hilbert space must be convex. Many partial answers to this problem are available in the literature. R.R. Phelps[Proc. Amer. Math. Soc. 8 (1957, 790-797] showed that a Chebyshev set in an inner product space (or in a strictly convex normed linear space is convex if the associated metric projection is non-expansive. We extend this result to metricspaces.

  11. Global Optimization Approach to Non-convex Problems

    Institute of Scientific and Technical Information of China (English)

    LU Zi-fang; ZHENG Hui-li

    2004-01-01

    A new approach to find the global optimal solution of the special non-convex problems is proposed in this paper. The non-convex objective problem is first decomposed into two convex sub-problems. Then a generalized gradient is introduced to determine a search direction and the evolution equation is built to obtain a global minimum point. By the approach, we can prevent the search process from some local minima and search a global minimum point. Two numerical examples are given to prove the approach to be effective.

  12. CONVERGENCE PROPERTIES OF PROJECTEDGRADIENT METHODS WITH NONMONOTONIC BACK TRACKING TECHNIQUE FOR CONVEX CONSTRAINED OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    ZHU Detong

    2000-01-01

    This paper proposes projected gradient algorithms in association with using both trust region and line search techniques for convex constrained optimization problems.The mixed strategy is adopted which switches to back tracking steps when a trial projected gradient step produced by the trust region subproblem is unacceptable. A nonmonotone criterion is used to speed up the convergence progress in some curves with large curvature.A theoretical analysis is given which proves that the proposed algorithms are globally convergent and have local superlinear convergence rate under some reasonable conditions.The results of numerical experiments are reported to show the effectiveness of the proposed algorithms.

  13. Deleting Outliers in Robust Regression with Mixed Integer Programming

    Institute of Scientific and Technical Information of China (English)

    Georgios Zioutas; Antonios Avramidis

    2005-01-01

    In robust regression we often have to decide how many are the unusual observations, which should be removed from the sample in order to obtain better fitting for the rest of the observations. Generally, we use the basic principle of LTS, which is to fit the majority of the data, identifying as outliers those points that cause the biggest damage to the robust fit. However, in the LTS regression method the choice of default values for high break down-point affects seriously the efficiency of the estimator. In the proposed approach we introduce penalty cost for discarding an outlier, consequently, the best fit for the majority of the data is obtained by discarding only catastrophic observations. This penalty cost is based on robust design weights and high break down-point residual scale taken from the LTS estimator. The robust estimation is obtained by solving a convex quadratic mixed integer programming problem, where in the objective function the sum of the squared residuals and penalties for discarding observations is minimized. The proposed mathematical programming formula is suitable for small-sample data. Moreover, we conduct a simulation study to compare other robust estimators with our approach in terms of their efficiency and robustness.

  14. Prolonging sensor networks lifetime using convex clusters

    Directory of Open Access Journals (Sweden)

    Payam Salehi

    2013-11-01

    Full Text Available Reducing the energy consumption of nodes in sensor networks and prolonging the network life time has been proposed as one of the most important challenges facing researchers in the field of sensor networks. Therefore, designing an energy-aware protocol to gather data from network level and transmitting it to sink is placed on the agenda at this paper. After presenting an analysis of the processes of clustering in sensory networks and investigating the effect of sending interval on the amount of energy consumption, We have shown that if the use of convex static casters be done such as all the communications within the cluster with the sending distance less than the optimal threshold, it Will help to increase the lifetime of nodes. also have shown that if we create a virtual backbone between cluster heads to transfer far cluster heads data from sink to sink , will has a significant impact on increasing the network lifetime. For this reason, a detailed discussion on how to determine the size of clusters and partitioning of the network environment to them is presented in Chapter 4.Simulation results show considerable improvement of the proposed algorithm.

  15. Flip to Regular Triangulation and Convex Hull.

    Science.gov (United States)

    Gao, Mingcen; Cao, Thanh-Tung; Tan, Tiow-Seng

    2017-02-01

    Flip is a simple and local operation to transform one triangulation to another. It makes changes only to some neighboring simplices, without considering any attribute or configuration global in nature to the triangulation. Thanks to this characteristic, several flips can be independently applied to different small, non-overlapping regions of one triangulation. Such operation is favored when designing algorithms for data-parallel, massively multithreaded hardware, such as the GPU. However, most existing flip algorithms are designed to be executed sequentially, and usually need some restrictions on the execution order of flips, making them hard to be adapted to parallel computation. In this paper, we present an in depth study of flip algorithms in low dimensions, with the emphasis on the flexibility of their execution order. In particular, we propose a series of provably correct flip algorithms for regular triangulation and convex hull in 2D and 3D, with implementations for both CPUs and GPUs. Our experiment shows that our GPU implementation for constructing these structures from a given point set achieves up to two orders of magnitude of speedup over other popular single-threaded CPU implementation of existing algorithms.

  16. Convex weighting criteria for speaking rate estimation

    Science.gov (United States)

    Jiao, Yishan; Berisha, Visar; Tu, Ming; Liss, Julie

    2015-01-01

    Speaking rate estimation directly from the speech waveform is a long-standing problem in speech signal processing. In this paper, we pose the speaking rate estimation problem as that of estimating a temporal density function whose integral over a given interval yields the speaking rate within that interval. In contrast to many existing methods, we avoid the more difficult task of detecting individual phonemes within the speech signal and we avoid heuristics such as thresholding the temporal envelope to estimate the number of vowels. Rather, the proposed method aims to learn an optimal weighting function that can be directly applied to time-frequency features in a speech signal to yield a temporal density function. We propose two convex cost functions for learning the weighting functions and an adaptation strategy to customize the approach to a particular speaker using minimal training. The algorithms are evaluated on the TIMIT corpus, on a dysarthric speech corpus, and on the ICSI Switchboard spontaneous speech corpus. Results show that the proposed methods outperform three competing methods on both healthy and dysarthric speech. In addition, for spontaneous speech rate estimation, the result show a high correlation between the estimated speaking rate and ground truth values. PMID:26167516

  17. Convexity and symmetrization in relativistic theories

    Science.gov (United States)

    Ruggeri, T.

    1990-09-01

    There is a strong motivation for the desire to have symmetric hyperbolic field equations in thermodynamics, because they guarantee well-posedness of Cauchy problems. A generic quasi-linear first order system of balance laws — in the non-relativistic case — can be shown to be symmetric hyperbolic, if the entropy density is concave with respect to the variables. In relativistic thermodynamics this is not so. This paper shows that there exists a scalar quantity in relativistic thermodynamics whose concavity guarantees a symmetric hyperbolic system. But that quantity — we call it —bar h — is not the entropy, although it is closely related to it. It is formed by contracting the entropy flux vector — ha with a privileged time-like congruencebar ξ _α . It is also shown that the convexity of h plus the requirement that all speeds be smaller than the speed of light c provide symmetric hyperbolic field equations for all choices of the direction of time. At this level of generality the physical meaning of —h is unknown. However, in many circumstances it is equal to the entropy. This is so, of course, in the non-relativistic limit but also in the non-dissipative relativistic fluid and even in relativistic extended thermodynamics for a non-degenerate gas.

  18. Constrained neural approaches to quadratic assignment problems.

    Science.gov (United States)

    Ishii, S; Sato, M

    1998-08-01

    In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.

  19. Automatic differentiation for reduced sequential quadratic programming

    Institute of Scientific and Technical Information of China (English)

    Liao Liangcai; Li Jin; Tan Yuejin

    2007-01-01

    In order to slove the large-scale nonlinear programming (NLP) problems efficiently, an efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem is solved by improved rSQP solver. In the solving process, AD technology is used to obtain accurate gradient information. The numerical results show that the combined algorithm, which is suitable for large-scale process optimization problems, can calculate more efficiently than rSQP itself.

  20. Bianchi I solutions of effective quadratic gravity

    CERN Document Server

    Müller, Daniel

    2012-01-01

    It is believed that soon after the Planck time, Einstein's general relativity theory should be corrected to an effective quadratic theory. Numerical solutions for the anisotropic generalization of the Friedmann "flat" model $E^3$ for this effective gravity are given. It must be emphasized that although numeric, these solutions are exact in the sense that they depend only on the precision of the machine. The solutions are identified asymptotically in a certain sense. It is found solutions which asymptote de Sitter space, Minkowski space and a singularity. This work is a generalization for non diagonal spatial metrics of a previous result obtained by one of us and a collaborator for Bianchi $I$ spaces.

  1. Linear Stability Analysis of Dynamical Quadratic Gravity

    CERN Document Server

    Ayzenberg, Dimitry; Yunes, Nicolas

    2013-01-01

    We perform a linear stability analysis of dynamical, quadratic gravity in the high-frequency, geometric optics approximation. This analysis is based on a study of gravitational and scalar modes propagating on spherically-symmetric and axially-symmetric, vacuum solutions of the theory. We find dispersion relations that do no lead to exponential growth of the propagating modes, suggesting the theory is linearly stable on these backgrounds. The modes are found to propagate at subluminal and superluminal speeds, depending on the propagating modes' direction relative to the background geometry, just as in dynamical Chern-Simons gravity.

  2. Range-based estimation of quadratic variation

    DEFF Research Database (Denmark)

    Christensen, Kim; Podolskij, Mark

    In this paper, we propose using realized range-based estimation to draw inference about the quadratic variation of jump-diffusion processes. We also construct a new test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the te...... is well-sized and more powerful than a return-based t-statistic for sampling frequencies normally used in empirical work. Applied to equity data, we find that the intensity of the jump process is not as high as previously reported....

  3. Range-based estimation of quadratic variation

    DEFF Research Database (Denmark)

    Christensen, Kim; Podolskij, Mark

    This paper proposes using realized range-based estimators to draw inference about the quadratic variation of jump-diffusion processes. We also construct a range-based test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the ......, the test is well-sized and more powerful than a return-based t-statistic for sampling frequencies normally used in empirical work. Applied to equity data, we show that the intensity of the jump process is not as high as previously reported....

  4. A simple convex optimization problem with many applications

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    1994-01-01

    This paper presents an algorithm for the solution of a simple convex optimization problem. This problem is a generalization of several other optimization problems which have applications to resource allocation, optimal capacity expansion, and vehicle scheduling. The algorithm is based...

  5. Differential subordination for meromorphic multivalent quasi-convex functions

    OpenAIRE

    R. W. Ibrahim; M. Darus

    2010-01-01

    We introduce new classes of meromorphic multivalent quasi-convex functions and find some sufficient differential subordination theorems for such classes in punctured unit disk with applications in fractional calculus.

  6. Differential subordination for meromorphic multivalent quasi-convex functions

    Directory of Open Access Journals (Sweden)

    R. W. Ibrahim

    2010-02-01

    Full Text Available We introduce new classes of meromorphic multivalent quasi-convex functions and find some sufficient differential subordination theorems for such classes in punctured unit disk with applications in fractional calculus.

  7. Global optimization over linear constraint non-convex programming problem

    Institute of Scientific and Technical Information of China (English)

    ZHANG Gui-Jun; WU Ti-Huan; YE Rong; YANG Hai-qing

    2005-01-01

    A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programmin g problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.

  8. Lipschitz estimates for convex functions with respect to vector fields

    Directory of Open Access Journals (Sweden)

    Valentino Magnani

    2012-12-01

    Full Text Available We present Lipschitz continuity estimates for a class of convex functions with respect to Hörmander vector fields. These results have been recently obtained in collaboration with M. Scienza, [22].

  9. A novel neural network for nonlinear convex programming.

    Science.gov (United States)

    Gao, Xing-Bao

    2004-05-01

    In this paper, we present a neural network for solving the nonlinear convex programming problem in real time by means of the projection method. The main idea is to convert the convex programming problem into a variational inequality problem. Then a dynamical system and a convex energy function are constructed for resulting variational inequality problem. It is shown that the proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. Compared with the existing neural networks for solving the nonlinear convex programming problem, the proposed neural network has no Lipschitz condition, no adjustable parameter, and its structure is simple. The validity and transient behavior of the proposed neural network are demonstrated by some simulation results.

  10. Entropy and convexity for nonlinear partial differential equations.

    Science.gov (United States)

    Ball, John M; Chen, Gui-Qiang G

    2013-12-28

    Partial differential equations are ubiquitous in almost all applications of mathematics, where they provide a natural mathematical description of many phenomena involving change in physical, chemical, biological and social processes. The concept of entropy originated in thermodynamics and statistical physics during the nineteenth century to describe the heat exchanges that occur in the thermal processes in a thermodynamic system, while the original notion of convexity is for sets and functions in mathematics. Since then, entropy and convexity have become two of the most important concepts in mathematics. In particular, nonlinear methods via entropy and convexity have been playing an increasingly important role in the analysis of nonlinear partial differential equations in recent decades. This opening article of the Theme Issue is intended to provide an introduction to entropy, convexity and related nonlinear methods for the analysis of nonlinear partial differential equations. We also provide a brief discussion about the content and contributions of the papers that make up this Theme Issue.

  11. Subaperture Stitching Interferometry for Large Convex Aspheric Surfaces Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The size and accuracy specifications of telescope mirrors are ever more demanding. This is particularly true for secondary mirrors, as they are convex and thus...

  12. A Convex Optimization Approach to pMRI Reconstruction

    CERN Document Server

    Zhang, Cishen

    2013-01-01

    In parallel magnetic resonance imaging (pMRI) reconstruction without using estimation of coil sensitivity functions, one group of algorithms reconstruct sensitivity encoded images of the coils first followed by the magnitude only image reconstruction, e.g. GRAPPA, and another group of algorithms jointly compute the image and sensitivity functions by regularized optimization which is a non-convex problem with local only solutions. For the magnitude only image reconstruction, this paper derives a reconstruction formulation, which is linear in the magnitude image, and an associated convex hull in the solution space of the formulated equation containing the magnitude of the image. As a result, the magnitude only image reconstruction for pMRI is formulated into a two-step convex optimization problem, which has a globally optimal solution. An algorithm based on split-bregman and nuclear norm regularized optimizations is proposed to implement the two-step convex optimization and its applications to phantom and in-vi...

  13. Two new definitions on convexity and related inequalities

    CERN Document Server

    Tunc, Mevlut

    2012-01-01

    We have made some new definitions using the inequalities of Young' and Nesbitt'. And we have given some features of these new definitions. After, we established new Hadamard type inequalities for convex functions in the Young and Nesbitt sense.

  14. Continuity of Extremal Elements in Uniformly Convex Spaces

    OpenAIRE

    Ferguson, Timothy

    2013-01-01

    In this paper, we study the problem of finding the extremal element for a linear functional over a uniformly convex Banach space. We show that a unique extremal element exists and depends continuously on the linear functional, and vice versa. Using this, we simplify and clarify Ryabykh's proof that for any linear functional on a uniformly convex Bergman space with kernel in a certain Hardy space, the extremal functional belongs to the corresponding Hardy space.

  15. Convex games, clan games, and their marginal games

    OpenAIRE

    Branzei , Rodica; Dimitrov, Dinko; Tijs, Stef

    2005-01-01

    We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with respect to the members of a coalition C is a total clan game (with clan C) if and only if all its C-based marginal games are subadditive.

  16. Convex Aspherical Surface Testing Using Catadioptric Partial Compensating System

    Science.gov (United States)

    Wang, Jingxian; Hao, Qun; Hu, Yao; Wang, Shaopu; Li, Tengfei; Tian, Yuhan; Li, Lin

    2016-01-01

    Aspheric optical components are the indispensable part of modern optics systems. With the constant development of aspheric optical fabrication technique, the systems with large aperture convex aspheric optical components are widely used in astronomy and space optics. Thus, the measurement of the figure error of the whole convex aspherical surface with high precision comes to be a challenge in the area of optical surface manufacture, and surface testing method is also very important. This paper presents a new partial compensating system by the combination of a refractive lens and a reflective mirror for testing convex aspherical surface. The refractive lens is used to compensate the aberration of the tested convex asphere partially. The reflective mirror is a spherical mirror which is coaxial to the refractive lens and reflecting the lights reflected by the tested convex asphere back to the convex asphere itself. With the long focal length and large aperture system we can realize a lighter and more compact system than the refractive partial compensating system because the spheric reflective mirror is more easily to realize and can bending the light conveniently.

  17. RATIONAL QUADRATIC B-SPLINE INTERPOLATION OF FUNCTION SEGMENTS%函数的分段有理二次B样条插值

    Institute of Scientific and Technical Information of China (English)

    梁锡坤

    2012-01-01

    Based on the proper segmentation of complicated functions, the triangle convex hull of functions segment is introduced. We propose a scheme of control polygon determination by the tangent of the endpoints of the segment intervals. The algorithm of the segment rational quadratic B-spline interpolation of complicated functions is discussed in details. The interpolation keeps many important geometric features of the original function such as convexity, monotonicity and G1 continuity. The numerical experiments show that the algorithm provides an efficient approach to approximate representation of complicated functions.%0引 言 科学和工程计算中,函数的近似表示一直是一个重要课题.近似方法一般可归结为插值、逼近和拟合三种基本类型,经历长期发展,函数逼近方法[1-3]十分丰富.

  18. Quadratic forms for Feynman-Kac semigroups

    Energy Technology Data Exchange (ETDEWEB)

    Hibey, Joseph L. [Department of Electrical Engineering, University of Colorado at Denver, Campus Box 110, Denver, CO 80217 (United States)]. E-mail: joseph.hibey@cudenver.edu; Charalambous, Charalambos D. [Electrical and Computer Engineering Department, University of Cyprus, 75 Kallipoleos Avenue, Nicosia (Cyprus)]. E-mail: chadcha@ucy.ac.cy

    2006-05-15

    Some problems in a stochastic setting often involve the need to evaluate the Feynman-Kac formula that follows from models described in terms of stochastic differential equations. Equivalent representations in terms of partial differential equations are also of interest, and these establish the well-known connection between probabilistic and deterministic formulations of these problems. In this Letter, this connection is studied in terms of the quadratic form associated with the Feynman-Kac semigroup. The probability measures that naturally arise in this approach, and thus define how Brownian motion is killed at a specified rate while exiting a set, are interpreted as a random time change of the original stochastic differential equation. Furthermore, since random time changes alter the diffusion coefficients in stochastic differential equations while Girsanov-type measure transformations alter their drift coefficients, their simultaneous use should lead to more tractable solutions for some classes of problems. For example, the minimization of some quadratic forms leads to solutions that satisfy certain partial differential equations and, therefore, the techniques discussed provide a variational approach for finding these solutions.

  19. Facets for the Cardinality Constrained Quadratic Knapsack Problem and the Quadratic Selective Travelling Salesman Problem

    DEFF Research Database (Denmark)

    Mak, Vicky; Thomadsen, Tommy

    2004-01-01

    A well-known extension of the Travelling Salesman Problem (TSP) is the Selective (or Prize-collecting) TSP: In addition to the edge-costs, each node has an associated reward (denoted the node-reward) and instead of visiting all nodes, only profitable nodes are visited. The Quadratic Selective TSP...

  20. Spectral calibration for convex grating imaging spectrometer

    Science.gov (United States)

    Zhou, Jiankang; Chen, Xinhua; Ji, Yiqun; Chen, Yuheng; Shen, Weimin

    2013-12-01

    Spectral calibration of imaging spectrometer plays an important role for acquiring target accurate spectrum. There are two spectral calibration types in essence, the wavelength scanning and characteristic line sampling. Only the calibrated pixel is used for the wavelength scanning methods and he spectral response function (SRF) is constructed by the calibrated pixel itself. The different wavelength can be generated by the monochromator. The SRF is constructed by adjacent pixels of the calibrated one for the characteristic line sampling methods. And the pixels are illuminated by the narrow spectrum line and the center wavelength of the spectral line is exactly known. The calibration result comes from scanning method is precise, but it takes much time and data to deal with. The wavelength scanning method cannot be used in field or space environment. The characteristic line sampling method is simple, but the calibration precision is not easy to confirm. The standard spectroscopic lamp is used to calibrate our manufactured convex grating imaging spectrometer which has Offner concentric structure and can supply high resolution and uniform spectral signal. Gaussian fitting algorithm is used to determine the center position and the Full-Width-Half-Maximum(FWHM)of the characteristic spectrum line. The central wavelengths and FWHMs of spectral pixels are calibrated by cubic polynomial fitting. By setting a fitting error thresh hold and abandoning the maximum deviation point, an optimization calculation is achieved. The integrated calibration experiment equipment for spectral calibration is developed to enhance calibration efficiency. The spectral calibration result comes from spectral lamp method are verified by monochromator wavelength scanning calibration technique. The result shows that spectral calibration uncertainty of FWHM and center wavelength are both less than 0.08nm, or 5.2% of spectral FWHM.

  1. Stochastic convex sparse principal component analysis.

    Science.gov (United States)

    Baytas, Inci M; Lin, Kaixiang; Wang, Fei; Jain, Anil K; Zhou, Jiayu

    2016-12-01

    Principal component analysis (PCA) is a dimensionality reduction and data analysis tool commonly used in many areas. The main idea of PCA is to represent high-dimensional data with a few representative components that capture most of the variance present in the data. However, there is an obvious disadvantage of traditional PCA when it is applied to analyze data where interpretability is important. In applications, where the features have some physical meanings, we lose the ability to interpret the principal components extracted by conventional PCA because each principal component is a linear combination of all the original features. For this reason, sparse PCA has been proposed to improve the interpretability of traditional PCA by introducing sparsity to the loading vectors of principal components. The sparse PCA can be formulated as an ℓ1 regularized optimization problem, which can be solved by proximal gradient methods. However, these methods do not scale well because computation of the exact gradient is generally required at each iteration. Stochastic gradient framework addresses this challenge by computing an expected gradient at each iteration. Nevertheless, stochastic approaches typically have low convergence rates due to the high variance. In this paper, we propose a convex sparse principal component analysis (Cvx-SPCA), which leverages a proximal variance reduced stochastic scheme to achieve a geometric convergence rate. We further show that the convergence analysis can be significantly simplified by using a weak condition which allows a broader class of objectives to be applied. The efficiency and effectiveness of the proposed method are demonstrated on a large-scale electronic medical record cohort.

  2. Fixed Points of Single- and Set-Valued Mappings in Uniformly Convex Metric Spaces with No Metric Convexity

    Directory of Open Access Journals (Sweden)

    Rafa Espínola

    2010-01-01

    Full Text Available We study the existence of fixed points and convergence of iterates for asymptotic pointwise contractions in uniformly convex metric spaces. We also study the existence of fixed points for set-valued nonexpansive mappings in the same class of spaces. Our results do not assume convexity of the metric which makes a big difference when studying the existence of fixed points for set-valued mappings.

  3. On a general class of quadratic hopping sequences

    Institute of Scientific and Technical Information of China (English)

    JIA HuaDing; YUAN Ding; PENG DaiYuan; GUO Ling

    2008-01-01

    Based upon quadratic polynomials over the finite field, a new class of frequency hopping sequences with large family size suitable for applications in time/frequency hopping CDMA systems, multi-user radar and sonar systems is proposed and investigated. It is shown that the new time/frequency hopping sequences have at most one hit in their autocorrelation functions and at most two hits in their crosscorrelation functions except for a special case, and their family size is much larger than the conventional quadratic hopping sequences. The percentage of full collisions for the new quadratic hopping sequences is discussed. In addition, the average number of hits for the new quadratic hopping sequences, quadratic congruence sequences, extended quadratic congruence sequences and the general linear hopping sequences are also derived.

  4. Quadratic residues and non-residues selected topics

    CERN Document Server

    Wright, Steve

    2016-01-01

    This book offers an account of the classical theory of quadratic residues and non-residues with the goal of using that theory as a lens through which to view the development of some of the fundamental methods employed in modern elementary, algebraic, and analytic number theory. The first three chapters present some basic facts and the history of quadratic residues and non-residues and discuss various proofs of the Law of Quadratic Reciprosity in depth, with an emphasis on the six proofs that Gauss published. The remaining seven chapters explore some interesting applications of the Law of Quadratic Reciprocity, prove some results concerning the distribution and arithmetic structure of quadratic residues and non-residues, provide a detailed proof of Dirichlet’s Class-Number Formula, and discuss the question of whether quadratic residues are randomly distributed. The text is a valuable resource for graduate and advanced undergraduate students as well as for mathematicians interested in number theory.

  5. On Quadratic BSDEs with Final Condition in L2

    OpenAIRE

    Yang, Hanlin

    2015-01-01

    This thesis consists of three parts. In the first part, we study $\\mathbb{L}^p$ solutions of a large class of BSDEs. Existence, comparison theorem, uniqueness and a stability result are proved. In the second part, we establish the solvability of quadratic semimartingale BSDEs. In contrast to current literature, we use Lipschitz-quadratic regularization and obtain the existence and uniqueness results with minimal assumptions. The third part is a brief summary of quadratic semimartingales and t...

  6. Quadratic forms and Clifford algebras on derived stacks

    OpenAIRE

    Vezzosi, Gabriele

    2013-01-01

    In this paper we present an approach to quadratic structures in derived algebraic geometry. We define derived n-shifted quadratic complexes, over derived affine stacks and over general derived stacks, and give several examples of those. We define the associated notion of derived Clifford algebra, in all these contexts, and compare it with its classical version, when they both apply. Finally, we prove three main existence results for derived shifted quadratic forms over derived stacks, define ...

  7. Some Aspects of Quadratic Generalized White Noise Functionals

    Science.gov (United States)

    Si, Si; Hida, Takeyuki

    2009-02-01

    We shall discuss some particular roles of quadratic generalized white noise functionals. First observation is made from the viewpoint of the so-called "la passage du fini à l'infini". We then come to a dual pairing of spaces formed by quadratic generalized white noise functionals. In this line, we can further discuss quadratic forms of differential operators acting on the space of white noise functionals.

  8. The Knaster-Kuratowski-Mazurkiewicz theorem and abstract convexities

    Science.gov (United States)

    Cain, George L., Jr.; González, Luis

    2008-02-01

    The Knaster-Kuratowski-Mazurkiewicz covering theorem (KKM), is the basic ingredient in the proofs of many so-called "intersection" theorems and related fixed point theorems (including the famous Brouwer fixed point theorem). The KKM theorem was extended from Rn to Hausdorff linear spaces by Ky Fan. There has subsequently been a plethora of attempts at extending the KKM type results to arbitrary topological spaces. Virtually all these involve the introduction of some sort of abstract convexity structure for a topological space, among others we could mention H-spaces and G-spaces. We have introduced a new abstract convexity structure that generalizes the concept of a metric space with a convex structure, introduced by E. Michael in [E. Michael, Convex structures and continuous selections, Canad. J. MathE 11 (1959) 556-575] and called a topological space endowed with this structure an M-space. In an article by Shie Park and Hoonjoo Kim [S. Park, H. Kim, Coincidence theorems for admissible multifunctions on generalized convex spaces, J. Math. Anal. Appl. 197 (1996) 173-187], the concepts of G-spaces and metric spaces with Michael's convex structure, were mentioned together but no kind of relationship was shown. In this article, we prove that G-spaces and M-spaces are close related. We also introduce here the concept of an L-space, which is inspired in the MC-spaces of J.V. Llinares [J.V. Llinares, Unified treatment of the problem of existence of maximal elements in binary relations: A characterization, J. Math. Econom. 29 (1998) 285-302], and establish relationships between the convexities of these spaces with the spaces previously mentioned.

  9. A Quadratic Programming Algorithm for Max-cut Problem%最大割问题的二次规划方法

    Institute of Scientific and Technical Information of China (English)

    王新辉; 刘三阳; 刘红卫

    2003-01-01

    In this paper, a quadratic programming algorithm is presented to solve Max-cut problem. This algorithm can give a better bound of Max-cut problem by a convex quadratic programming resulted from the semidefinite programming relaxation. Then, the branch and bound method is used to gain the solution of Max-cut problem. Numerical results show that the algorithm is availability and efficient.%本文给出了最大割问题的二次规划算法.这种算法通过求解最大割问题的二次规划松弛给出了一种较好的界,然后用分支定界法得到了最大割问题的解.数值结果表明这种算法是非常有效的.

  10. Quadratic dynamical decoupling with nonuniform error suppression

    Energy Technology Data Exchange (ETDEWEB)

    Quiroz, Gregory; Lidar, Daniel A. [Department of Physics and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089 (United States); Departments of Electrical Engineering, Chemistry, and Physics, and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089 (United States)

    2011-10-15

    We analyze numerically the performance of the near-optimal quadratic dynamical decoupling (QDD) single-qubit decoherence errors suppression method [J. West et al., Phys. Rev. Lett. 104, 130501 (2010)]. The QDD sequence is formed by nesting two optimal Uhrig dynamical decoupling sequences for two orthogonal axes, comprising N{sub 1} and N{sub 2} pulses, respectively. Varying these numbers, we study the decoherence suppression properties of QDD directly by isolating the errors associated with each system basis operator present in the system-bath interaction Hamiltonian. Each individual error scales with the lowest order of the Dyson series, therefore immediately yielding the order of decoherence suppression. We show that the error suppression properties of QDD are dependent upon the parities of N{sub 1} and N{sub 2}, and near-optimal performance is achieved for general single-qubit interactions when N{sub 1}=N{sub 2}.

  11. The Quadratic Selective Travelling Salesman Problem

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2003-01-01

    complication that each pair of nodes have an associated profit which can be gained only if both nodes are visited. The QSTSP is a subproblem when constructing hierarchical ring networks. We describe an integer linear programming model for the QSTSP. The QSTSP is solved by two construction heuristics...... solutions at a cost of much higher running time. All problems with up to 50 nodes are solved within one hour.......A well-known extension of the Travelling Salesman Problem (TSP) is the Selective TSP (STSP): Each node has an associated profit and instead of visiting all nodes, the most profitable set of nodes, taking into account the tour cost, is visited. The Quadratic STSP (QSTSP) adds the additional...

  12. Compact stars with quadratic equation of state

    CERN Document Server

    Ngubelanga, Sifiso A; Ray, Subharthi

    2015-01-01

    We provide new exact solutions to the Einstein-Maxwell system of equations for matter configurations with anisotropy and charge. The spacetime is static and spherically symmetric. A quadratic equation of state is utilised for the matter distribution. By specifying a particular form for one of the gravitational potentials and the electric field intensity we obtain new exact solutions in isotropic coordinates. In our general class of models, an earlier model with a linear equation of state is regained. For particular choices of parameters we regain the masses of the stars PSR J1614-2230, 4U 1608-52, PSR J1903+0327, EXO 1745-248 and SAX J1808.4-3658. A comprehensive physical analysis for the star PSR J1903+0327 reveals that our model is reasonable.

  13. Directed animals, quadratic and rewriting systems

    CERN Document Server

    Marckert, Jean-François

    2011-01-01

    A directed animal is a percolation cluster in the directed site percolation model. The aim of this paper is to exhibit a strong relation between in one hand, the problem of computing the generating function $\\G$ of directed animals on the square lattice, counted according to the area and the perimeter, and on the other hand, the problem to find a solution to a system of quadratic equations involving unknown matrices. The matrices solution of this problem can be finite or infinite. We were unable to find finite solutions. We present some solid clues that some infinite explicit matrices, fix points of a rewriting like system are the natural solutions of this system of equations: some strong evidences are given that the problem of finding $\\G$ reduces then to the problem of finding an eigenvector to an explicit infinite matrix. Similar properties are shown for other combinatorial questions concerning directed animals, and for different lattices.

  14. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2002-01-01

    Lambda-lifting is a program transformation used in compilers and in partial evaluators and that operates in cubic time. In this article, we show how to reduce this complexity to quadratic time. Lambda-lifting transforms a block-structured program into a set of recursive equations, one for each...... local function in the source program. Each equation carries extra parameters to account for the free variables of the corresponding local function and of all its callees. It is the search for these extra parameters that yields the cubic factor in the traditional formulation of lambda-lifting, which...... is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity of lambda-lifting from O(n 3 log n)toO(n2 log n), where n is the size of the program. Since a lambda-lifter can output...

  15. Linear ultrasonic motor using quadrate plate transducer

    Institute of Scientific and Technical Information of China (English)

    Jiamei JIN; Chunsheng ZHAO

    2009-01-01

    A linear ultrasonic motor using a quadrate plate transducer was developed for precision positioning. This motor consists of two pairs of Pb(Zr, Ti)O3 piezo-electric ceramic elements, which are piezoelectrically excited into the second-bending mode of the motor stator's neutral surface in two orthogonal directions, on which the tops of four projections move along an elliptical trajectory, which in turn drives a contacted slider into linear motion via frictional forces. The coincident frequency of the stator is easily obtained for its coincident characteristic dimen-sion in two orthogonal directions. The performance characteristics achieved by the motor are: 1) a maximum linear speed of more than 60 mm/s; 2) a stroke of more than 150 mm; 3) a driving force of more than 5.0 N; and 4) a response time of about 2 ms.

  16. Large-scale sequential quadratic programming algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Eldersveld, S.K.

    1992-09-01

    The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function. Only an estimate of the reduced Hessian matrix is required by our algorithm. The impact of not having available the full Hessian approximation is studied and alternative estimates are constructed. 2. The use of a transformation matrix Q. This allows the QP gradient to be computed easily when only the reduced Hessian approximation is maintained. 3. The use of a reduced-gradient form of the basis for the null space of the working set. This choice of basis is more practical than an orthogonal null-space basis for large-scale problems. The continuity condition for this choice is proven. 4. The use of incomplete solutions of quadratic programming subproblems. Certain iterates generated by an active-set method for the QP subproblem are used in place of the QP minimizer to define the search direction for the nonlinear problem. An implementation of the new algorithm has been obtained by modifying the code MINOS. Results and comparisons with MINOS and NPSOL are given for the new algorithm on a set of 92 test problems.

  17. Non-differentiable second-order mixed symmetric duality with cone constraints

    Directory of Open Access Journals (Sweden)

    Shiv Kumar Gupta

    2012-10-01

    Full Text Available A pair of mixed non-differentiable second-order symmetric dual programmesover cones is considered. Weak, strong and converse duality theorems are establishedunder second-order (F, convexity/pseudo-convexity assumptions. Special cases arealso discussed to show that this paper extends some known results in the literature.

  18. Characterization and Moment Stability Analysis of Quasilinear Quantum Stochastic Systems with Quadratic Coupling to External Fields

    CERN Document Server

    Vladimirov, Igor G

    2012-01-01

    The paper is concerned with open quantum systems whose Heisenberg dynamics are described by quantum stochastic differential equations driven by external boson fields. The system-field coupling operators are assumed to be quadratic polynomials of the system observables, with the latter satisfying canonical commutation relations. In combination with a cubic system Hamiltonian, this leads to a class of quasilinear quantum stochastic systems which retain algebraic closedness in the evolution of mixed moments of the observables. Although such a system is nonlinear and its quantum state is no longer Gaussian, the dynamics of the moments of any order are amenable to exact analysis, including the computation of their steady-state values. In particular, a generalized criterion is developed for quadratic stability of the quasilinear systems. The results of the paper are applicable to the generation of non-Gaussian quantum states with manageable moments and an optimal design of linear quantum controllers for quasilinear...

  19. The optimal solution of a non-convex state-dependent LQR problem and its applications.

    Directory of Open Access Journals (Sweden)

    Xudan Xu

    Full Text Available This paper studies a Non-convex State-dependent Linear Quadratic Regulator (NSLQR problem, in which the control penalty weighting matrix [Formula: see text] in the performance index is state-dependent. A necessary and sufficient condition for the optimal solution is established with a rigorous proof by Euler-Lagrange Equation. It is found that the optimal solution of the NSLQR problem can be obtained by solving a Pseudo-Differential-Riccati-Equation (PDRE simultaneously with the closed-loop system equation. A Comparison Theorem for the PDRE is given to facilitate solution methods for the PDRE. A linear time-variant system is employed as an example in simulation to verify the proposed optimal solution. As a non-trivial application, a goal pursuit process in psychology is modeled as a NSLQR problem and two typical goal pursuit behaviors found in human and animals are reproduced using different control weighting [Formula: see text]. It is found that these two behaviors save control energy and cause less stress over Conventional Control Behavior typified by the LQR control with a constant control weighting [Formula: see text], in situations where only the goal discrepancy at the terminal time is of concern, such as in Marathon races and target hitting missions.

  20. New Heuristic Rounding Approaches to the Quadratic Assignment Problem

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

    Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.