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 98 for “"Interior-point method"”.

  1. Computational Study of Kernel - Based Interior - Point Method for LCP

    … and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the …

    gsu Repository record for Computational Study of Kernel - Based Interior - Point Method for LCP (opens in a new tab)

  2. Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

    In this thesis, we present a new Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates …

    gsu Repository record for Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems (opens in a new tab)

  3. AN IMPLEMENTATION OF AN INTERIOR POINT METHOD FOR EXTENDED LINEAR-QUADRATIC PROGRAMMING

    … decade has witnessed a tremendous development in interior point methods for mathematical programs. Various interior point methods have been successfully implemented in many areas including linear programming, convex quadratic programming, linear complementarity problem and convex programming. …

    nus Repository record for AN IMPLEMENTATION OF AN INTERIOR POINT METHOD FOR EXTENDED LINEAR-QUADRATIC PROGRAMMING (opens in a new tab) Download file for AN IMPLEMENTATION OF AN INTERIOR POINT METHOD FOR EXTENDED LINEAR-QUADRATIC PROGRAMMING (opens in a new tab)

  4. Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

    … we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration …

    gsu Repository record for Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems (opens in a new tab)

  5. Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

    <p>In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters …

    gsu Repository record for Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems (opens in a new tab)

  6. The interior point method and its application to the fractional (g.f)-factor problem

    … Chapter 1 to Chapter 5, we give an exposition of interiorpoint methods (IPM). In Chapter 1 a brief survey of the recent development in interior-point methods is given. Chapter 2 gives a detailed description on the history of the primal-dual pathfollowing methods for linear programming. Chapter 3 …

    ubc Repository record for The interior point method and its application to the fractional (g.f)-factor problem (opens in a new tab) Download PDF for The interior point method and its application to the fractional (g.f)-factor problem (opens in a new tab)

  7. A Conic Quadratic Interior-Point Method for a Class of Stratified Sampling Problems

    … of this thesis is to numerically test two interior point methods on the stratified sampling problem. First, a homogeneous conic quadratic interior point method was used to solve the stratified sampling problem as a reformulated conic quadratic problem Then, a nonlinear homogeneous interior …

    gsu Repository record for A Conic Quadratic Interior-Point Method for a Class of Stratified Sampling Problems (opens in a new tab)

  8. Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones

    In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of …

    gsu Repository record for Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones (opens in a new tab)

  9. Path-Following Interior Point Method With Improved Iteration Bounds For Monotone Linear Complementarity Problem

    In this thesis, we present a path-following interior point method (IPM) algorithm to solve a monotone linear complementarity problem (LCP). A new eligible kernel function will be used to help improve the theoretical iteration bounds for the path-following IPM algorithm. IPM algorithms have two …

    gsu Repository record for Path-Following Interior Point Method With Improved Iteration Bounds For Monotone Linear Complementarity Problem (opens in a new tab)

  10. A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming

    Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …

    rice Repository record for A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming (opens in a new tab)

  11. Efficient Numerical Optimization for Parallel Dynamic Optimal Power Flow Simulation Using Network Geometry

    In this work, we present a parallel method for accelerating the multi-period dynamic optimal power flow (DOPF). Our approach involves a distributed-memory parallelization of DOPF time-steps, use of a newly developed parallel primal-dual interior point method, and an iterative Krylov subspace linear …

    sdstate Repository record for Efficient Numerical Optimization for Parallel Dynamic Optimal Power Flow Simulation Using Network Geometry (opens in a new tab)

  12. Advanced Interior Point Formulation for the Global Routing Problem

    … becomes increasingly important. One of the methods to solve global routing is to formulate the problem as an integer programming (IP) problem. This formulation can then be relaxed into a linear programming problem and solved using interior point method. This thesis investigates two new …

    waterloo Repository record for Advanced Interior Point Formulation for the Global Routing Problem (opens in a new tab)

  13. Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming

    Interior-point methods have been intensively studied during the last few decades. In theory, interior-point methods can solve a wide range of convex programming problems to high accuracy in polynomial time. In practice, the difficulty faced by interior-point methods is to compute the search …

    nus Repository record for Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming (opens in a new tab) Download file for Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming (opens in a new tab)

  14. Optimal control of systems with constraints

    … In this chapter, we derive an alternative method for solving the linearly constrained LQG problem. Drawing inspiration from the field of interior point methods, we .derive a path following interior point method for linearly constrained quadratic programming to infinite dimensions. In this …

    anu Repository record for Optimal control of systems with constraints (opens in a new tab)

  15. Computational complexity analysis of linear optimization algorithms

    … of our study on the performance of the Exterior Point Simplex algorithm, the Interior Point Method, and the Primal and Dual Simplex algorithms. Our objective is to generate valid and accurate prediction models for the computational performance of these algorithms. Our analysis is separated in …

    greece Repository record for Computational complexity analysis of linear optimization algorithms (opens in a new tab)

  16. Computing optimal designs for regression models via convex programming

    Optimal design problems aim at selecting design points optimally with respect to certain statistical criteria. The research of this thesis focuses on optimal design problems with respect to A-, D- and E-optimal criteria, which minimize the trace, determinant and largest eigenvalue of the …

    uvic Repository record for Computing optimal designs for regression models via convex programming (opens in a new tab)

  17. The behavior of Newton's method on two equivalent systems from linear and nonlinear programming

    Newton's method is a fundamental technique for approximating solutions of nonlinear equations. However, it is often not fully appreciated that the method can produce significantly different behavior when applied to equivalent systems. In this thesis, we investigate differences in local and global …

    rice Repository record for The behavior of Newton's method on two equivalent systems from linear and nonlinear programming (opens in a new tab)

  18. Optimization Methods in Geometric Shape Approximation

    … thesis studies the application of optimization methods in approximating geometric shapes. In particular, it considers the problem of finding maximum volume (axis-aligned) inscribed parallelotopes and boxes in a compact convex set, defined by a finite number of convex inequalities, and presents …

    umn Repository record for Optimization Methods in Geometric Shape Approximation (opens in a new tab)

  19. A comparison of transcription techniques for the optimal control of the International Space Station

    … few decades. In particular, direct transcription methods have been studied because of their convergence properties for even relatively poor guesses at the solution. This thesis explores two of these techniques—Legendre-Gauss-Lobatto (LGL) Pseudospectral (PS) Collocation and Multiple Shooting (MS), …

    rice Repository record for A comparison of transcription techniques for the optimal control of the International Space Station (opens in a new tab)

  20. Finding the Densest Common Subgraph with Linear Programming

    … DCS LP can be shortened considerably by using an interior-point method instead of the simplex method. The DCS LP is also compared to a greedy algorithm and a Lagrangian relaxation of DCS LP.We conclude that the greedy algorithm is a good heuristic while the LP is well suited to problems where a …

    chalmers Repository record for Finding the Densest Common Subgraph with Linear Programming (opens in a new tab)

Page 1 of 5