Learn More
A common strategy for achieving global convergence in the solution of semi-innnite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively ner discretization meshes. Finely discretized minimax and SIP problems, as well as other problems with many more(More)
A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local(More)
reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from North-Holland. Abstract. Extension of quasi-Newton techniques from unconstrained to constrained optimization via(More)
applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and dynamic problems of engineering technology and systems for industry and government. Abstract An exact-penalty-function-based scheme—inspired from an old idea due to Mayne and Polak (Math. Prog., vol. 11, 1976, pp. 67–80)—is proposed for(More)
We propose an adaptive, constraint-reduced, primal-dual interior-point algorithm for convex quadratic programming with many more inequality constraints than variables. We reduce the computational effort by assembling , instead of the exact normal-equation matrix, an approximate matrix from a well chosen index set which includes indices of constraints that(More)
We determine a joint link activation and routing policy that maximizes the stable throughput region of time-varying wireless ad-hoc networks with multiple commodities. In practice, the state of the channel process from the time it is observed till the time a transmission actually takes place can be significantly different. With this in mind, we introduce a(More)
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +∞ and −∞. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist(More)
An exact-penalty-function-based scheme—inspired from an old idea due to Mayne and Polak [Math. Program., 11 (1976), pp. 67–80]—is proposed for extending to general smooth constrained optimization problems any given feasible interior-point method for inequality constrained problems. It is shown that the primal-dual interior-point framework allows for a(More)