Sciweavers

276 search results - page 43 / 56
» Global Optimization of Probabilistically Constrained Linear ...
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
TSP
2012
13 years 5 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
FOCM
2007
94views more  FOCM 2007»
14 years 9 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
GLOBECOM
2007
IEEE
15 years 4 months ago
Using MILP for Optimal Movement Planning in MANETs with Cooperative Mobility
— Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of coopera...
Ghassen Ben Brahim, Osama Awwad, Ala I. Al-Fuqaha,...