Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 566 for “"Quadratic Programming"”.

  1. Convex and quadratic programming

    … deals primarily with the theory of convex and quadratic programming problems and discusses algorithmic procedures used in solving such problems.</p><p>A general overview of mathematical programming is given in Chapter I. It includes formulations of linear, convex, and quadratic problems and a …

    ut-knoxville Repository record for Convex and quadratic programming (opens in a new tab)

  2. The convex quadratic programming problem

    … of this paper is to investigate the convex quadratic programming problem and its applications. The emphasis is on methods for solving the convex quadratic programming problem.</p> <p>Chapter I discusses the general background of the problem and developes necessary and sufficient conditions …

    ut-knoxville Repository record for The convex quadratic programming problem (opens in a new tab)

  3. Maximum Entropy Sequential Quadratic Programming

    … technique to solve such problems is Sequential Quadratic Programming (SQP). This method iteratively solves a series of quadratic subproblems, each of which relies on first- and second-order approximations of the constraints and cost around a nominal trajectory. However, since each subproblem …

    gatech Repository record for Maximum Entropy Sequential Quadratic Programming (opens in a new tab)

  4. Quadratic programming with linear inequality constraints

    The least-squares method of optimization of quadratic functions is the most common and widely practiced. The exact procedure in matrix form, is described by Boot, p.25 [2]. Some of the merits of the least-squares method are discussed in [1]. This thesis discusses this least-squares method of …

    ttu Repository record for Quadratic programming with linear inequality constraints (opens in a new tab)

  5. Robust Group Synchronization via Quadratic Programming

    … synchronization problem and discuss ournovel quadratic programming formulation for estimating the corruption levels in group synchronization, and use these estimates to solve this problem. Our objective function exploits the cycle consistency of the group and we thus refer to our method as …

    umn Repository record for Robust Group Synchronization via Quadratic Programming (opens in a new tab)

  6. Computational convex analysis using parametric quadratic programming

    The class of piecewise linear-quadratic (PLQ) functions is a very important class of functions in convex analysis since the result of most convex operators applied to a PLQ function is a PLQ function. Although there exists a wide range of algorithms for univariate PLQ functions, recent work has …

    ubc Repository record for Computational convex analysis using parametric quadratic programming (opens in a new tab) Download PDF for Computational convex analysis using parametric quadratic programming (opens in a new tab)

  7. Resolution of Ties in Parametric Quadratic Programming

    We consider the convex parametric quadratic programming problem when the end of the parametric interval is caused by a multiplicity of possibilities ("ties"). In such cases, there is no clear way for the proper active set to be determined for the parametric analysis to continue. In this thesis, we …

    waterloo Repository record for Resolution of Ties in Parametric Quadratic Programming (opens in a new tab)

  8. New results on some quadratic programming problems

    … algorithms for several special classes of quadratic programming problems. The problems we study can be classifiedinto two categories. The first group contains two optimization problems with binary constraints. To solve these problems, we first explore some intrinsic relation between binary …

    uiuc Repository record for New results on some quadratic programming problems (opens in a new tab)

  9. Quadratic programming as an extension of linear programming

    In the past two decades Mathematical Programming has come to occupy a place of importance in Economic Studies and in Operations Research. Roughly speaking, Mathematical Programming is the analysis of problems of the type: "Find the maximum of a function, when the variables are subject to inequality …

    cape-town Repository record for Quadratic programming as an extension of linear programming (opens in a new tab)

  10. Indefinite Knapsack Separable Quadratic Programming: Methods and Applications

    <p>Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if …

    utk-theses Repository record for Indefinite Knapsack Separable Quadratic Programming: Methods and Applications (opens in a new tab)

  11. Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming)

    This thesis is a study of a wide variety of combinatorial optimization problems.

    uiuc Repository record for Topics in Combinatorial Algorithms (Multicommodity Flows, Quadratic Programming) (opens in a new tab)

  12. Quadratic programming : quantitative analysis and polynomial running time algorithms

    … be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first to present a polynomial algorithm for solving linear …

    ubc Repository record for Quadratic programming : quantitative analysis and polynomial running time algorithms (opens in a new tab) Download PDF for Quadratic programming : quantitative analysis and polynomial running time algorithms (opens in a new tab)

  13. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming

    Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some …

    waterloo Repository record for On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming (opens in a new tab)

Page 1 of 29