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 12 of 12 for “"Convex quadratic program"”.

  1. On the Use of Quasi-Newton Methods for the Minimization of Convex Quadratic Splines

    In reformulating a strictly convex quadratic program with simple bound constraints as the unconstrained minimization of a strictly convex quadratic spline, established algorithms can be implemented with relaxed differentiability conditions. In this work, the positive definite secant update method …

    odu Repository record for On the Use of Quasi-Newton Methods for the Minimization of Convex Quadratic Splines (opens in a new tab)

  2. A parallel active-set method for solving frictional contact problems

    … algorithm, requires the solution of two convex quadratic program (QP) subproblems at each iteration. We introduce a method, SCHURPA, which employs a primal-dual active-set strategy to efficiently solve these QPs based on a Schur-complement method. A single factorization of the initial …

    ubc Repository record for A parallel active-set method for solving frictional contact problems (opens in a new tab) Download PDF for A parallel active-set method for solving frictional contact problems (opens in a new tab)

  3. Alternating Optimization for the Dense Subgraph and Submatrix Problems

    Large-scale mathematical programming is a popular tool in machine learning. Although there are many efficient algorithms which seem to perform well in empirical trials, most theoretical analyses of the behavior of machine learning heuristics have been limited to simple learning tasks such as the …

    alabama Repository record for Alternating Optimization for the Dense Subgraph and Submatrix Problems (opens in a new tab)

  4. Dynamic Spectral and Systems-Theoretic Approaches for Inference and Control of Heterogeneous Complex Networks

    … the optimal control problem into a simple convex quadratic program with linear constraints, applicable to both open-loop and feedback control tasks within a model-based setting. We demonstrate its efficacy through numerical simulations and experimental validations on ensembles of …

    wustl Repository record for Dynamic Spectral and Systems-Theoretic Approaches for Inference and Control of Heterogeneous Complex Networks (opens in a new tab)

  5. Dynamic Spectral and Systems-Theoretic Approaches for Inference and Control of Heterogeneous Complex Networks

    … the optimal control problem into a simple convex quadratic program with linear constraints, applicable to both open-loop and feedback control tasks within a model-based setting. We demonstrate its efficacy through numerical simulations and experimental validations on ensembles of …

    wustl Repository record for Dynamic Spectral and Systems-Theoretic Approaches for Inference and Control of Heterogeneous Complex Networks (opens in a new tab)

  6. An efficient analytical placement algorithm using cell shifting, iterative local refinement and a hybrid net model

    … the fixed-die context. FastPlace is based on the quadratic placement approach. The quadratic approach formulates the wirelength minimization problem as a convex quadratic program, which can be solved analytically by some efficient techniques. However, the quadratic approach in general suffers from …

    iastate Repository record for An efficient analytical placement algorithm using cell shifting, iterative local refinement and a hybrid net model (opens in a new tab)

  7. Optimization-based analysis of rigid mechanical systems with unilateral contact and kinetic friction

    … the solution set of an arbitrary LCP may be nonconvex, which poses the following computational and theoretical problems: if an arbitrary solution of the LCP is chosen, the computed force distributions over continuous contact regions may change discontinuously as a function of time. This could …

    washington Repository record for Optimization-based analysis of rigid mechanical systems with unilateral contact and kinetic friction (opens in a new tab)

  8. Multistage quadratic stochastic programming

    Multistage stochastic programming is an important tool in medium to long term planning where there are uncertainties in the data. In this thesis, we consider a special case of multistage stochastic programming in which each subprogram is a convex quadratic program. The results are also applicable …

    unsw Repository record for Multistage quadratic stochastic programming (opens in a new tab)

  9. Eliminating residual non-binary intensities in pixelated EUV source optimization

    … (SO) for EUV lithography has been posed as a convex quadratic program (QP) whose decision variables are pupil pixel intensities. The result of this QP generated an almost binary illuminator (~95%), where optimal solutions are composed of pixels lying almost exclusively at the set boundaries (0 …

    bu Repository record for Eliminating residual non-binary intensities in pixelated EUV source optimization (opens in a new tab)

  10. Hierarchical Control of Constrained Multi-Agent Legged Locomotion: A Data-Driven Approach

    … and is cast into the form of a strictly convex quadratic program. This partial feedback linearization is then relaxed through the use of a defect variable, where said defect variable is allowed only to change in a manner that is consistent with rapidly exponentially stable output dynamics …

    vt Repository record for Hierarchical Control of Constrained Multi-Agent Legged Locomotion: A Data-Driven Approach (opens in a new tab)

  11. Robust Large Margin Approaches for Machine Learning in Adversarial Settings

    … is highly efficient and is formulated as a convex quadratic program. Empirical evaluations confirm that this technique not only secures the prediction algorithm in the presence of an adversary, but it also generalizes to future inputs better, even if there is no adversary. While our robust …

    oregon Repository record for Robust Large Margin Approaches for Machine Learning in Adversarial Settings (opens in a new tab)

  12. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming

    … weighted paths associated with the semidefinite program (SDP) map $X^{1/2}SX^{1/2}$ was studied and some applications to error bound analysis and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale well-structured sparse …

    gatech Repository record for Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming (opens in a new tab)