Primal-Dual Optimization Algorithms over Riemannian Manifolds: an Iteration Complexity Analysis

In this paper we study nonconvex and nonsmooth multi-block optimization over Riemannian manifolds with coupled linear constraints. Such optimization problems naturally arise from machine learning, statistical learning, compressive sensing, image processing, and tensor PCA, among others. We develop an ADMM-like primal-dual approach based on decoupled solvable subroutines such as linearized proximal mappings. First, we introduce … Read more

A multi-period production and distribution optimization model for radiopharmaceuticals

This paper addresses the manufacturing and distribution of short-lived radio-pharmaceuticals which are mainly used in diagnostic imaging studies. We develop a mixed integer nonlinear optimization model that is flexible enough to capture the complex underlying nuclear physics of the production process of fludeoxyglucose (FDG), which is widely used in oncology and cardiology, as well as … Read more

Enriching Solutions to Combinatorial Problems via Solution Engineering

Existing approaches to identify multiple solutions to combinatorial problems in practice are at best limited in their ability to simultaneously incorporate both diversity among generated solutions, as well as problem-specific desires that are apriori unknown, or at least difficult to articulate, for the end-user. We propose a general framework that can generate a set of … Read more

Primal-Dual Hybrid Gradient Method for Distributionally Robust Optimization Problems

We focus on the discretization approach to distributionally robust optimization (DRO) problems and propose a numerical scheme originated from the primal-dual hybrid gradient (PDHG) method that recently has been well studied in convex optimization area. Specifically, we consider the cases where the ambiguity set of the discretized DRO model is defined through the moment condition … Read more

Uniqueness and Multiplicity of Market Equilibria on DC Power Flow Networks

We consider uniqueness and multiplicity of market equilibria in a short-run setup where traded quantities of electricity are transported through a capacitated network in which power flows have to satisfy the classical lossless DC approximation. The firms face fluctuating demand and decide on their production, which is constrained by given capacities. Today, uniqueness of such … Read more

NeatWork, a tool for the design of gravity-driven water distribution systems for poor rural communities

NeatWork is an advanced optimization and simulation tool for the design of purely gravity-driven water distribution systems aiming at delivering clean water to poor rural communities. The exclusion of any adjustable devices, such as pumps and valves, for controlling pressures and flows is motivated by two main reasons: firstly, the system should be as simple … Read more

Energy Technology Environment Model with Smart Grid and Robust Nodal Electricity Prices

This paper deals with the modeling of power flow in a transmission grid within the multi-sectoral multi-energy long-term regional energy model ETEM-SG. This extension of the model allows a better representation of demand response for flexible loads triggered by nodal marginal cost pricing. To keep the global model in the realm of linear program- ming … Read more

Globally Solving the Trust Region Subproblem Using Simple First-Order Methods

We consider the trust region subproblem which is given by a minimization of a quadratic, not necessarily convex, function over the Euclidean ball. Based on the well-known second-order necessary and sufficient optimality conditions for this problem, we present two sufficient optimality conditions defined solely in terms of the primal variables. Each of these conditions corresponds … Read more

Balancing Communication and Computation in Distributed Optimization

Methods for distributed optimization have received significant attention in recent years owing to their wide applicability in various domains including machine learning, robotics and sensor networks. A distributed optimization method typically consists of two key components: communication and computation. More specifically, at every iteration (or every several iterations) of a distributed algorithm, each node in … Read more

On the Optimal Proximal Parameter of an ADMM-like Splitting Method for Separable Convex Programming

An ADMM-based splitting method is proposed in [11] for solving convex minimization problems with linear constraints and multi-block separable objective functions; while a relatively large proximal parameter is required for theoretically ensuring the convergence. In this paper, we further study this method and find its optimal (smallest) proximal parameter. For succinctness, we focus on the … Read more