In this paper, we propose a redistributed proximal bundle method for class of nonconvex nonsmooth optimization problems with inexact information, i.e., consider the problem computing approximate critical points when only information about function values and subgradients are available show that reasonable convergence properties obtained. We assume errors in computation functions bounded princip...

This paper presents a real-time solution method of the maximum divert trajectory optimization problem for planetary landing. In mid-course, the vehicle is to abort and retarget to a landing site as far from the nominal as physically possible. The divert trajectory must satisfy velocity constraints in the range and cross range directions and a total speed constraint. The thrust magnitude is boun...

We seek distributed protocols that attain the global optimum allocation of link transmitter powers and source rates in a cross-layer design of a mobile ad-hoc network. Although the underlying network utility maximization is nonconvex, convexity plays a major role in our development. We provide new convexity results surrounding the Shannon capacity formula, allowing us to abandon suboptimal high...

We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is related to the area of on-line searching. Adhikari and Pitman (1989) proved that the optimal solution has length 2.2782 . . . We present a simpler proof, which exploits the fact that the width of a polygon does not decrease unde...

For the problem of estimating a sparse sequence of coefficients of a parametric or nonparametric generalized linear model, posterior mode estimation with a Subbotin(λ, ν) prior achieves thresholding and therefore model selection when ν ∈ [0, 1] for a class of likelihood functions. The proposed estimator also offers a continuum between the (forward/backward) best subset estimator (ν = 0), its ap...