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 51 for “"dual algorithm"”.

  1. A Primal Dual Algorithm On 2-Steiner Graphs

    … which we call 2-Steiner instances, via a primal-dual method.

    waterloo Repository record for A Primal Dual Algorithm On 2-Steiner Graphs (opens in a new tab)

  2. Dual algorithm for L1 isotonic optimization on a partially ordered set

    … problem, we try to take advantage of duality. For any x in X, let U(x) and L(x) denote the immediate successors of x and the immediate predecessors of x respectively. Define the set L by L = (x,y) |x ϵ X, y ϵ U(x) . Let w and F be functions on X and L respectively. The dual problem …

    iastate Repository record for Dual algorithm for L1 isotonic optimization on a partially ordered set (opens in a new tab)

  3. A primal-dual algorithm for the maximum charge problem with capacity constraints

    … the total sum of the charges. We use the primal-dual approach. We propose a combinatorial algorithm for solving the dual of the restricted primal and show that the primal-dual algorithm runs in a polynomial time.

    lethbridge Repository record for A primal-dual algorithm for the maximum charge problem with capacity constraints (opens in a new tab)

  4. A Dual Algorithm for the Weighted Euclidean Distance Min-Max Location Problem in R^2 and R^3

    A dual approach algorithm is given for the solution of the weighted min-max location problem with Euclidean distance in R^2 and R^3. Each subproblem is solved using a directional search procedure and by taking advantage of its geometric structure. An algebraic replacement rule is employed to update …

    clemson Repository record for A Dual Algorithm for the Weighted Euclidean Distance Min-Max Location Problem in R^2 and R^3 (opens in a new tab)

  5. Linear Programming Algorithms Using Least-Squares Method

    … is a computational study of recently developed algorithms which aim to overcome degeneracy in the simplex method. We study the following algorithms: the non-negative least squares algorithm, the least-squares primal-dual algorithm, the least-squares network flow algorithm, and the …

    gatech Repository record for Linear Programming Algorithms Using Least-Squares Method (opens in a new tab)

  6. A technique for speeding convergence in solving linear programs

    … for solving linear programs using the primal-dual algorithm is presented. It appears that the new method will also decrease the number of iterations over any other simplex algorithm. A FORTRAN program incorporating the technique, as well as some comparative computational results are given.

    nps Repository record for A technique for speeding convergence in solving linear programs (opens in a new tab)

  7. Semidefinite Relaxation-Based Soft MIMO Demodulation via Efficient Dual Scaling

    … In particular, we develop a customized dual-scaling algorithm to solve the semidefinite program that constitutes the core computational task of the SDR-based soft demodulator. The computational cost per iteration of the customized dual algorithm is about half that of the existing …

    mcmaster Repository record for Semidefinite Relaxation-Based Soft MIMO Demodulation via Efficient Dual Scaling (opens in a new tab)

  8. Network flow optimization and distributed control algorithms

    … concerns the problem of designing distributed algorithms for achieving efficient and fair bandwidth allocations in a resource constrained network. This problem is fundamental to the design of transmission protocols for communication networks, since the fluid models of popular protocols such as …

    maryland Repository record for Network flow optimization and distributed control algorithms (opens in a new tab)

  9. An algorithm for the solution of linear programming problems.

    … for applications for linear programs. The primaldual algorithm, in which the constraints are added one at a time, is investigated as a possible faster solution method. A computer program was developed to compare this method with the standard primal-dual algorithm using the full set of constraints …

    nps Repository record for An algorithm for the solution of linear programming problems. (opens in a new tab)

  10. Parallel Algorithms For Steiner Forest

    … 96/95. Several heuristic and approximation algorithms, with different approximation guarantees, have been proposed for the Steiner Forest Problem. Despite the several research in designing sequential and parallel algorithms to its closely related problem, Steiner Tree Problem, we are not …

    wayne-thes Repository record for Parallel Algorithms For Steiner Forest (opens in a new tab)

  11. Duality in linear inequalities and linear programming

    … It aims, through use of theory of the duals, to set some formal connections between linear inequalities and linear programming problems, as well as to lay theoretical foundations for certain practical algorithms having been used to solve a general linear program.</p> <p>In particular, …

    ut-knoxville Repository record for Duality in linear inequalities and linear programming (opens in a new tab)

  12. Algorithmic Aspects of the Internet

    … in the field of exact and approximation algorithms for many of the problems arising in the context of the Internet. We will formalize the method of dual fitting and the idea of factor-revealing LP. We use this combination to design and analyze two greedy algorithms for the metric …

    gatech Repository record for Algorithmic Aspects of the Internet (opens in a new tab)

  13. Deblurring with Framelets in the Sparse Analysis Setting

    In this thesis, algorithms for blind and non-blind motion deblurring of digital images are proposed. The non-blind algorithm is based on a convex program consisting of a data fitting term and a sparsity-promoting regularization term. The data fitting term is the squared l_2 norm of the residual …

    uvic Repository record for Deblurring with Framelets in the Sparse Analysis Setting (opens in a new tab)

  14. Algorithms for Some Clustering Problems

    … new insight into two well-known approximation algorithms for the uncapacitated facility location problem: the primal-dual algorithm of Jain & Vazirani, and an algorithm of Mettu & Plaxton. The main result answers positively a question posed by Jain and Vazirani of whether their algorithm can be …

    cornell Repository record for Algorithms for Some Clustering Problems (opens in a new tab)

  15. GRAPH CUTS, SUM-OF-SUBMODULAR FLOW, AND LINEAR PROGRAMMING: EFFECTIVE INFERENCE IN HIGHER-ORDER MARKOV RANDOM FIELDS

    Optimization algorithms have a long history of success in computer vision, providing effective algorithms for tasks as varied as segmentation, stereo estimation, image denoising and scene understanding. A notable example of this is Graph Cuts, in which the minimum-cut problem is used to solve a …

    cornell Repository record for GRAPH CUTS, SUM-OF-SUBMODULAR FLOW, AND LINEAR PROGRAMMING: EFFECTIVE INFERENCE IN HIGHER-ORDER MARKOV RANDOM FIELDS (opens in a new tab)

  16. Solving Saddle Point Formulations of Linear Programs with Frank-Wolfe

    … make use of the Simplex method and primal-dual interior-point methods which are able to provide accurate solutions in a reasonable amount of time for most problems. However, both the Simplex method and interior-point methods require solving a system of linear equations at each iteration, an …

    waterloo Repository record for Solving Saddle Point Formulations of Linear Programs with Frank-Wolfe (opens in a new tab)

  17. Primal-dual techniques for nonlinear programming and applications to artificial neural network training.

    In this work, new developments in primal-dual techniques for general constrained non-linear programming problems are proposed. We first implement a modified version of the general nonlinear primal-dual algorithm that was published by El-Bakry et al. (21). We use the algorithm as a backbone of a new …

    oklahoma-thes Repository record for Primal-dual techniques for nonlinear programming and applications to artificial neural network training. (opens in a new tab)

Page 1 of 3