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 92 for “"Interior-point methods"”.

  1. Scaling and Interior Point Methods in Optimization

    … four algorithms that use either scaling or interior point methods for convex optimization problems; two of the algorithms use both.

    uiuc Repository record for Scaling and Interior Point Methods in Optimization (opens in a new tab)

  2. Interior-point methods for linear and mixed complementarity problems

    An infeasible interior-point method with backtracking line search is proposed to solve the linear complementarity and the general mixed complementarity problem. The standard nonlinear complementarity problem is a special case of the latter problem. The algorithm is based on a method for the general …

    greece Repository record for Interior-point methods for linear and mixed complementarity problems (opens in a new tab)

  3. Reoptimization in interior-point methods with application to integer programming

    … examines current reoptimization techniques for interior-point methods available in the literature and studies their efficacy in a branch-and-bound framework for 0/1 mixed integer programming problems. This work is motivated by the observation that there are instances of integer programming …

    rice Repository record for Reoptimization in interior-point methods with application to integer programming (opens in a new tab)

  4. Inexact interior point methods for constrained convex quadratic optimization problems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Inexact interior point methods for constrained convex quadratic optimization problems (opens in a new tab)

  5. Interior-point methods for minimization of potential energy functions of polypeptides

    Interior-point methods to minimize nonlinear, nonconvex potential energy function of proteins constrained by the bounds on dihedral angles are proposed. The first approach uses a barrier function to transform the original problem into a sequence of subproblems. First-order necessary conditions are …

    nus Repository record for Interior-point methods for minimization of potential energy functions of polypeptides (opens in a new tab) Download file for Interior-point methods for minimization of potential energy functions of polypeptides (opens in a new tab)

  6. Augmentation preconditioning for saddle point systems arising from interior point methods

    … solving linear systems arising from primal-dual interior point algorithms in linear and quadratic programming. The preconditioner has the attractive property of improved eigenvalue clustering with increased ill-conditioning of the (1,1) block of the saddle point matrix. We demonstrate performance …

    ubc Repository record for Augmentation preconditioning for saddle point systems arising from interior point methods (opens in a new tab) Download PDF for Augmentation preconditioning for saddle point systems arising from interior point methods (opens in a new tab)

  7. Effective finite termination procedures in interior-point methods for linear programming

    … to a linear program cannot be computed by an interior-point algorithm without adding features, such as finite termination procedures, to the algorithm. Finite termination procedures attempt to compute an exact solution in a finite number of steps. The addition of a finite termination procedure …

    rice Repository record for Effective finite termination procedures in interior-point methods for linear programming (opens in a new tab)

  8. Interior Point Methods and Kernel Functions of a Linear Programming Problem

    In this thesis the Interior -- Point Method (IPM) for Linear Programming problem (LP) that is based on the generic kernel function is considered. The complexity (in terms of iteration bounds) of the algorithm is first analyzed for a class of kernel functions defined by (3-1). This class is fairly …

    gsu Repository record for Interior Point Methods and Kernel Functions of a Linear Programming Problem (opens in a new tab)

  9. Using interior point methods to solve the multicommodity network flow problem.

    This thesis explores applications of Interior Point methods as popularized by Karmarkar (36) for solving Multicommodity Network Flow problems (MCNF). In these problems, several commodities must be shipped between various nodes of a network. The goal is to satisfy the shipping requirements at a …

    ottawa-retro Repository record for Using interior point methods to solve the multicommodity network flow problem. (opens in a new tab)

  10. Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods

    … implementation of infeasible-start primal-dual interior-point methods for convex optimization problems. Convex optimization has applications in many fields of engineering and science such as data analysis, control theory, signal processing, relaxation and randomization, and robust optimization. …

    waterloo Repository record for Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods (opens in a new tab)

  11. On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence

    Interior-point methods provide one of the most popular ways of solving convex optimization problems. Two advantages of modern interior-point methods over other approaches are: (1) robust global convergence, and (2) the ability to obtain high accuracy solutions in theory (and in practice, if the …

    waterloo Repository record for On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence (opens in a new tab)

  12. 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)

  13. On improving the accuracy of primal-dual interior point methods for linear programming

    … an implementation of an infeasible primal-dual interior-point (IPDIP) algorithm in LIPSOL, a linear programming solver. From our study, we learned that most test problems can achieve higher than the standard 10-8 accuracy used in practice, and a high condition number of the ill-conditioned …

    rice Repository record for On improving the accuracy of primal-dual interior point methods for linear programming (opens in a new tab)

  14. The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics

    Over the last 25 years, interior-point methods (IPMs) have emerged as a viable class of algorithms for solving various forms of conic optimization problems. Most IPMs use a modified Newton method to determine the search direction at each iteration. The system of equations corresponding to the …

    gatech Repository record for The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics (opens in a new tab)

  15. Spectral properties of matrices arising from primal-dual interior-point methods for convex quadratic programs

    … of convex quadratic programs using primal-dual interior-point methods has at its core the solution of a series of linear systems, which are in practice commonly reduced by block Gaussian elimination from the original unsymmetric block 3-by-3 formulation to either a block 2-by-2 saddle-point …

    ubc Repository record for Spectral properties of matrices arising from primal-dual interior-point methods for convex quadratic programs (opens in a new tab) Download PDF for Spectral properties of matrices arising from primal-dual interior-point methods for convex quadratic programs (opens in a new tab)

  16. A new class of preconditioners for large-scale linear systems from interior-point methods for linear programming

    … solution of the linear systems arising from interior point methods is proposed. For many of these methods, the linear systems come from applying Newton's method on the perturbed Karush-Kuhn-Tucker optimality conditions for the linear programming problem. This leads to a symmetric indefinite …

    rice Repository record for A new class of preconditioners for large-scale linear systems from interior-point methods for linear programming (opens in a new tab)

Page 1 of 5