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 65 for “"Primal-dual"”.
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… offline scenario, it is often common to see a dual analysis of problems that can be formulated as a linear or convex program. Primal-dual and dual-fitting techniques have been successfully applied to many such problems. Unfortunately, the usual tricks come short in an online setting since an …
-
Designing resilient lifeline networks a primal-dual optimization approach
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Krylov subspace methods for simultaneous primal-dual solutions and superconvergent functional estimates
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2002.
-
Constructing approximation algorithms via linear programming relaxations : primal dual and randomized rounding techniques
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.
-
A network-based primal-dual solution methodology for the multi-commodity network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1988.
-
A primal-dual conjugate subgradient algorithm for large- scale/specially structured linear programming problems
This dissertation deals with a primal-dual conjugate subgradient-based algorithm for solving large-scale and/or specially structured linear programming problems. The proposed algorithm coordinates a Lagrangian dual function and a primal penalty function which satisfies a flexible set of specified …
-
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 …
-
Special versus standard algorithms for large-scale harvest scheduling problems
… the decision variables belonging to each individual area constraints as independent knapsack problems. In Model II-Form 1, the network constraints constitute a longest path problem, and a Longest Path Algorithm is developed to solve this problem in closed form. The computational time for this …
-
Theory and Algorithms for Nonlinear Optimization and Variational Inequalities
… upon certain parameters. Finally, we describe a primal-dual path-following interior point algorithm for solving the pair of primal-dual problems (P) and (D):
-
Algorithmic and game-theoretic perspectives on scheduling
… for this problem, and give a combinatorial primal-dual 2-approximation algorithm.
-
Computational Study of Kernel - Based Interior - Point Method for LCP
… after introducing 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 …
-
Distributionally robust optimization with marginals : theory and applications
… the marginal distributions. We generalize the primal-dual formulations for this problem from the set of joint distributions with absolutely continuous marginal distributions to arbitrary marginal distributions using techniques from optimal transport theory.
-
Méthodes primales-duales pour la programmation non linéaire non convexe
… méthodes. Enfin, nous présentons un algorithme primal-dual de pénalité mixte qui utilise la technique de globalisation de recherche linéaire et une fonction de mérite primale-duale pour renforcer la convergence globale vers un point stationnaire de première ordre.
-
Algorithms for matrix completion
… regularization approach. To facilitate smooth primal optimization, we introduce a soft variational trace-norm and analyze a class of alternating optimization algorithms. We introduce a scalable primal-dual block coordinate descent algorithm for large sparse matrix completion. The algorithm …
-
Competitive algorithms for online matching and vertex cover problems
… bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental problem. An instance of such problems specifies a …
-
New Theory and New Practical Methods for Solving Large-Scale Linear and Conic Optimization
… interior-point methods) being replaced by the primal-dual hybrid gradient method (PDHG) to solve large-scale LP problems. While PDHG---with heuristic enhancements and GPU implementation---has been very successful in solving large-scale LP problems, its performance can have substantial variance …
-
Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems
… With this motivation, we present a practical primal-dual subgradient algorithm that incorporates a dual ascent, a primal recovery, and a penalty function approach to recover a near optimal and feasible pair of primal and dual solutions. The proposed primal-dual approach is comprised of three …
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
… complementary equation. A kernel-based primal-dual Interior-Point Method (IPM) for solving LCP was introduced and analyzed. The class of kernel functions used in this thesis is a class of so-called eligible kernel functions that are fairly general. We have shown for a positive …
-
Combinatorial optimization problems with concave costs
… technique that yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the corresponding combinatorial optimization problem.
Page 1 of 4