Now showing items 261-265 of 265
A Trust-Region Approach to the Regularization of Large-Scale Discrete Ill-Posed Problems
We consider the solution of large-scale least squares problems where the coefficient matrix comes from the discretization of an ill-posed operator and the right-hand size contains noise. Special techniques known as ...
Selective Search for Global Optimization of Zero or Small Residual Least-Squares Problems: A Numerical Study
In this paper, we consider searching for global minima of zero or small residual, nonlinear least-squares problems. We propose a selective search approach based on the concept of selective minimization recently introduced ...
Concavity Cuts for Disjoint Bilinear Programming
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin reformulations, leading to two sets of concavity cuts. We first ...
Implementing Functionals in HCL
Reoptimization in Interior-Point Methods with Application to Integer Programming
This thesis 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 ...