## New Penalized Stochastic Gradient Methods for Linearly Constrained Strongly Convex Optimization

For minimizing a strongly convex objective function subject to linear inequality constraints, we consider a penalty approach that allows one to utilize stochastic methods for problems with a large number of constraints and/or objective function terms. We provide upper bounds on the distance between the solutions to the original constrained problem and the penalty reformulations, … Read more

## A Decomposition Heuristic for Mixed-Integer Supply Chain Problems

Mixed-integer supply chain models typically are very large but are also very sparse and can be decomposed into loosely coupled blocks. In this paper, we use general-purpose techniques to obtain a block decomposition of supply chain instances and apply a tailored penalty alternating direction method, which exploits the structural properties of the decomposed instances. We … Read more

## Solving linear generalized Nash equilibrium problems numerically

This paper considers the numerical solution of linear generalized Nash equilibrium problems. Since many methods for nonlinear problems require the nonsingularity of some second order derivative, standard convergence conditions are not satisfied in our linear case. We provide new convergence criteria for a potential reduction algorithm that allow its application to linear generalized Nash equilibrium … Read more

## New Improved Penalty Methods for Sparse Reconstruction Based on Difference of Two Norms

In this paper, we further establish two types of DC (Difference of Convex functions) programming for $l_0$ sparse reconstruction. Our DC objective functions are specified to the difference of two norms. One is the difference of $l_1$ and $l_{\sigma_q}$ norms (DC $l_1$-$l_{\sigma_q}$ for short) where $l_{\sigma_q}$ is the $l_1$ norm of the $q$-term ($q\geq1$) best … Read more

## Portfolio Selection under Model Uncertainty: A Penalized Moment-Based Optimization Approach

We present a new approach for portfolio selection when the underlying distribution of asset returns is uncertain or ambiguous to investors. In particular, we consider the case that an investor can formulate some reference financial models based on his/her prior beliefs or information, but is concerned about misspecification of the reference models and the associated … Read more

## A First-Order Smoothed Penalty Method for Compressed Sensing

We propose a first-order smoothed penalty algorithm (SPA) to solve the sparse recovery problem min{||x||_1 : Ax=b}. SPA is efficient as long as the matrix-vector product Ax and A^Ty can be computed efficiently; in particular, A need not be an orthogonal projection matrix. SPA converges to the target signal by solving a sequence of penalized … Read more

## A Line Search Exact Penalty Method Using Steering Rules

Line search algorithms for nonlinear programming must include safeguards to enjoy global convergence properties. This paper describes an exact penalization approach that extends the class of problems that can be solved with line search SQP methods. In the new algorithm, the penalty parameter is adjusted at every iteration to ensure sufficient progress in linear feasibility … Read more