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 80 for “"warm start"”.

  1. Certifying Warm Start Priors for Linear Contextual Bandits

    … systems, yet they often suffer from the cold start problem. Warm-starting has been used to alleviate this by pretraining a bandit with auxiliary information before it interacts with real users. Large language models (LLMs) have emerged as a promising source of this information, simulating …

    queens Repository record for Certifying Warm Start Priors for Linear Contextual Bandits (opens in a new tab)

  2. Warm Start Algorithms for Bipartite Matching and Optimal Transport

    … high. To mitigate this, prior information or warm starts are commonly employed to accelerate computation. In this thesis, we propose two novel warm-start algorithms for solving the minimum-cost bipartite matching problem, with the first algorithm extending naturally to the optimal transport …

    vt Repository record for Warm Start Algorithms for Bipartite Matching and Optimal Transport (opens in a new tab)

  3. PERSISTENCE AND WARM-START OPTIMIZATION METHODS FOR LITTORAL CONNECTOR EMPLOYMENT

    … change. This research introduces persistence and warm-start techniques to address these limitations. The persistence penalty incentivizes continuity in connector route selection and serial arrival times across successive solves, reducing unnecessary changes when only minor input changes occur. The …

    nps Repository record for PERSISTENCE AND WARM-START OPTIMIZATION METHODS FOR LITTORAL CONNECTOR EMPLOYMENT (opens in a new tab)

  4. Analyzing Benchmarks and Methods for Contextual Bayesian Optimization Towards Personalized Healthcare Decisions

    … This framing enables direct comparison between warm-start methods and persistent transfer strategies across real, simulator-backed, and semisynthetic benchmarks. Across the benchmark suite, transfer is often beneficial, especially at initialization, but persistent transfer is not uniformly …

    umn Repository record for Analyzing Benchmarks and Methods for Contextual Bayesian Optimization Towards Personalized Healthcare Decisions (opens in a new tab)

  5. Multi-objective optimization for road vertical alignment design

    … of the chosen scalarization approaches, a warm start strategy is proposed. Numerical experiments are performed on 30 road samples for Caterpillar 793D off-highway trucks to determine the most robust approach for the proposed multi-objective optimization problem. The results are analyzed …

    ubc Repository record for Multi-objective optimization for road vertical alignment design (opens in a new tab) Download PDF for Multi-objective optimization for road vertical alignment design (opens in a new tab)

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

    … algorithm, in spite of the fact that effective "warm-start" techniques are available for the latter but not for the former. Because of many unresolved issues surrounding effective reoptimization techniques for interior-point methods, interior-point algorithms have not been commonly used as linear …

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

  7. Improving the efficiency of dynamic traffic assignment through computational methods based on combinatorial algorithm

    … improve its efficiency – this process is called “warm starting” the simulation-based DTA model. To further improve the efficiency of the simulation-based DTA model, the warm start process is made more efficient through parallel computing. Parallel computing was applied to the CDTA model and the …

    texas Repository record for Improving the efficiency of dynamic traffic assignment through computational methods based on combinatorial algorithm (opens in a new tab)

  8. Computational Methods for Fast and Secure Distributed Optimal Power Flow

    … time by securely computing a distributed OPF warm start using privacy-preserving neural networks. The secure warm start can be combined with bound tightening to drastically reduce the number of iterations required to converge, thus reducing computation time and improving data security. Fourth, …

    gatech Repository record for Computational Methods for Fast and Secure Distributed Optimal Power Flow (opens in a new tab)

  9. Creating Initial Solutions for the Tail Assignment Problem

    … which flight. Initial solutions can be used to warm-start optimization algorithms. In this thesis, the optimization algorithm uses a time window heuristic together with column generation. This thesis investigates different methods to create initial solutions for the tail assignment problem. The …

    chalmers Repository record for Creating Initial Solutions for the Tail Assignment Problem (opens in a new tab)

  10. Advanced Decomposition Methods in Stochastic Convex Optimization

    … V práci popisujeme novou metodu pro tvorbu “warm-start” řezů pro metodu zvanou “Generalized Benders Decomposition”, která se používá při řešení dvoustupňových stochastických problémů. Pro třídu úloh s pravděpodobnostním omezením zde uvádíme originální dekompoziční metodu, kterou jsme nazvali …

    brno-tech Repository record for Advanced Decomposition Methods in Stochastic Convex Optimization (opens in a new tab)

  11. Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems

    … support extensions for cutting planes and warm start are presented. We conclude with a computational study in which we show that our approach is competetive to state-of-the-art implementations using linear programming or semidefinite programming relaxations.

    qucosa-diss

  12. Freight train scheduling on a single line network

    … network, and use the solution obtained both as a warm start when solving the problem and as a primal bound for the objective function. We test the performance of our additions against the original formulation in 862 instances and find that results obtained from solving formulations that contain …

    unsw Repository record for Freight train scheduling on a single line network (opens in a new tab)

  13. Constraint Solving for User Interface Layout Problems

    … solving. Third, we investigate the use of a warm start strategy, which reuses the solution of a previous layout to warm start the solving of a new layout, taking into account that most layout changes during runtime are small. Another contribution of this thesis is an investigation of the …

    auckland-ms Repository record for Constraint Solving for User Interface Layout Problems (opens in a new tab)

  14. Recycling Techniques for Sequences of Linear Systems and Eigenproblems

    … cost of constructing the Krylov space starting with a single vector by warm-starting the eigensolver with a subspace instead. We propose an algorithm to warm-start the Krylov-Schur method using a previously computed approximate invariant subspace. We first compute the approximate Krylov …

    vt Repository record for Recycling Techniques for Sequences of Linear Systems and Eigenproblems (opens in a new tab)

  15. A Graph Convolutional Network approach for enhancing Set Covering Problem solvers

    … employed to predict node priority, serving as a warm start for the Gurobi solver. The GCN is trained on solutions from a classical greedy algorithm. The method integrates GCNs and Gurobi, unifying data-driven prediction and exact solver for better computation efficiency and scalability. …

    utc Repository record for A Graph Convolutional Network approach for enhancing Set Covering Problem solvers (opens in a new tab)

  16. Robust Optimization Approach for Systems under Uncertainty via Hybrid Metamodeling

    … Flow (AC-OPF) problem, developing a modified warm-start approach that integrates Q-learning and a novel loss function based on the probability distribution of solution input decision variables. While achieving improvements in solution quality and cost-effectiveness, the method presents mixed …

    utk-theses Repository record for Robust Optimization Approach for Systems under Uncertainty via Hybrid Metamodeling (opens in a new tab)

  17. Efficient Trust Region Subproblem Algorithms

    … polynomial interpolation. We also introduce a warm start approach and include a new treatment for the hard case for the trust region method. Sensitivity analysis is provided to show that the optimal objective value for the TRS is stable with respect to the trust region radius in both the easy …

    waterloo Repository record for Efficient Trust Region Subproblem Algorithms (opens in a new tab)

  18. Denoising the Design Space: Diffusion Models for Accelerated Airfoil Shape Optimization

    … statistically, in aerodynamic benchmarks, and in warm-start scenarios. We also extend our diffusion model approach, and demonstrate that the number of steps required for inference can be reduced by as much as ~86%, compared to an optimized version of the baseline inference process, without …

    maryland Repository record for Denoising the Design Space: Diffusion Models for Accelerated Airfoil Shape Optimization (opens in a new tab)

  19. Decentralized Transportation Model In Vehicle Sharing

    … Two simulated annealing methods, Gurobi with warm-start, and an extension of the local search algorithm are implemented on 24 instances derived from a comprehensive case study for experimental evaluation. The experimental results consistently demonstrate the superior performance of the …

    maryland Repository record for Decentralized Transportation Model In Vehicle Sharing (opens in a new tab)

  20. Algoritmo relax-and-cut para o problema do conjunto independente máximo

    … solutions to Lagrangian Subproblems. Next, in a warm start procedure, clique inequalities (that were dynamically dualized throughout the Relax-and-Cut algorithm) are appended to the reformulation, which is then submitted, in that reinforced form, to solver CPLEX. The Relax-and-Cut algorithm, just …

    brazil-uerj Repository record for Algoritmo relax-and-cut para o problema do conjunto independente máximo (opens in a new tab)

Page 1 of 4