The notion of a sharp, or strongly unique, minimum is extended to include the possibility of a
nonunique solution set. These minima will be called weak sharp minima. Conditions …

This text was developed from course notes written by Michael Patriksson and used over
several years at Chalmers University of Technology. The book's main focus is on providing a …

Given a finite number of closed convex sets whose algebraic representation is known, we
study the problem of finding the minimum of a convex function on the closure of the convex …

Publisher Summary This chapter presents the main theoretical and algorithmical results
pertaining to the traffic equilibrium problem (TEP), along the way improving theoretical …

Lagrangean dualization and subgradient optimization techniques are frequently used within
the field of computational optimization for finding approximate solutions to large, structured …

We exhibit useful properties of proximal bundle methods for finding \min_Sf, where f and S
are convex. We show that they asymptotically find objective subgradients and constraint …

We provide a sensitivity analysis of separable traffic equilibrium models with travel cost and
demand parameters. We establish that while equilibrium link flows may not always be …

This paper surveys the most basic traffic models based on the concept of traffic equilibria. It
describes the most fruitful formulations that have been used, together with characterizations …

This paper deals with convex optimization problems in the face of data uncertainty within the
framework of robust optimization. It provides various properties and characterizations of the …

This paper provides several new and simple characterizations of the solution sets of
pseudolinear programs. By means of the basic properties of pseudolinearity, the solution set …