In this paper, we focus on a rank-constrained optimization problem with a Schur-convex/concave objective function and multiple trace/log-determinant constraints. We first derive a structural result on ...

1. Inventory Optimization Through The QR Model Knowing when and how much to reorder to meet demand without overstocking is at the heart of effective inventory management.

Trajectory optimization problems under affine motion model and convex cost function are often solved through the convex-concave procedure (CCP), wherein the non-convex collision avoidance constraints ...

When applied to an unconstrained minimization problem with a convex objective, the steepest descent method has stronger convergence properties than in the noncovex case: the whole sequence converges ...