Anthony Man-Cho So

Orcid: 0000-0003-2588-7851

According to our database1, Anthony Man-Cho So authored at least 176 papers between 2005 and 2024.

Collaborative distances:

Timeline

2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
5
10
15
20
1
1
2
14
11
10
8
8
10
1
7
5
1
3
4
2
3
3
2
1
3
5
7
5
4
9
3
4
5
6
4
5
3
2
3
2
3
2
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians.
Math. Program., November, 2024

A Survey of Recent Advances in Optimization Methods for Wireless Communications.
IEEE J. Sel. Areas Commun., November, 2024

Guest Editorial Advanced Optimization Theory and Algorithms for Next-Generation Wireless Communication Networks.
IEEE J. Sel. Areas Commun., November, 2024

Riemannian Natural Gradient Methods.
SIAM J. Sci. Comput., February, 2024

Extreme Point Pursuit - Part II: Further Error Bound Analysis and Applications.
IEEE Trans. Signal Process., 2024

Extreme Point Pursuit - Part I: A Framework for Constant Modulus Optimization.
IEEE Trans. Signal Process., 2024

ROCS: Robust One-Bit Compressed Sensing With Application to Direction of Arrival.
IEEE Trans. Signal Process., 2024

Nonsmooth Optimization over the Stiefel Manifold and Beyond: Proximal Gradient Method and Recent Variants.
SIAM Rev., 2024

Network Games Induced Prior for Graph Topology Learning.
CoRR, 2024

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems.
CoRR, 2024

Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data.
CoRR, 2024

Spurious Stationarity and Hardness Results for Mirror Descent.
CoRR, 2024

A Survey of Advances in Optimization Methods for Wireless Communication System Design.
CoRR, 2024

Global strong convexity and characterization of critical points of time-of-arrival-based source localization.
Comput. Geom., 2024

Decentralized Non-Smooth Optimization Over the Stiefel Manifold.
Proceedings of the 13th IEEE Sensor Array and Multichannel Signal Processing Workshop, 2024

An Efficient Optimization Framework for Learning General Signed Graphs From Smooth Signals.
Proceedings of the 13th IEEE Sensor Array and Multichannel Signal Processing Workshop, 2024

An Efficient Alternating Riemannian/Projected Gradient Descent Ascent Algorithm for Fair Principal Component Analysis.
Proceedings of the IEEE International Conference on Acoustics, 2024

Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Non-Convex Joint Community Detection and Group Synchronization via Generalized Power Method.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
A unified flow scheduling method for time sensitive networks.
Comput. Networks, September, 2023

Variance-Reduced Stochastic Quasi-Newton Methods for Decentralized Learning.
IEEE Trans. Signal Process., 2023

A Linearly Convergent Optimization Framework for Learning Graphs From Smooth Signals.
IEEE Trans. Signal Inf. Process. over Networks, 2023

A Communication-Efficient Decentralized Newton's Method With Provably Faster Convergence.
IEEE Trans. Signal Inf. Process. over Networks, 2023

Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis.
SIAM J. Optim., 2023

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity.
CoRR, 2023

Decoder-Only or Encoder-Decoder? Interpreting Language Model as a Regularized Encoder-Decoder.
CoRR, 2023

Decentralized Weakly Convex Optimization Over the Stiefel Manifold.
CoRR, 2023

Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms.
CoRR, 2023

Outlier-Robust Gromov Wasserstein for Graph Data.
CoRR, 2023

A Stability Analysis of Fine-Tuning a Pre-Trained Model.
CoRR, 2023

Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

LogSpecT: Feasible Graph Learning Model from Stationary Signals with Recovery Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

ReSync: Riemannian Subgradient-based Robust Rotation Synchronization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Outlier-Robust Gromov-Wasserstein for Graph Data.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Projected Tensor Power Method for Hypergraph Community Recovery.
Proceedings of the International Conference on Machine Learning, 2023

A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

On the Effectiveness of Parameter-Efficient Fine-Tuning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Maximum Flow Routing Strategy With Dynamic Link Allocation for Space Information Networks Under Transceiver Constraints.
IEEE Trans. Veh. Technol., 2022

Probabilistic Simplex Component Analysis.
IEEE Trans. Signal Process., 2022

Distributionally Robust Graph Learning From Smooth Signals Under Moment Uncertainty.
IEEE Trans. Signal Process., 2022

Local Strong Convexity of Source Localization and Error Bound for Target Tracking under Time-of-Arrival Measurements.
IEEE Trans. Signal Process., 2022

SISAL Revisited.
SIAM J. Imaging Sci., 2022

Non-convex exact community recovery in stochastic block model.
Math. Program., 2022

Adaptive coordinate sampling for stochastic primal-dual optimization.
Int. Trans. Oper. Res., 2022

Nonsmooth Composite Nonconvex-Concave Minimax Optimization.
CoRR, 2022

Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Learning.
CoRR, 2022

Variance-Reduced Stochastic Quasi-Newton Methods for Decentralized Learning: Part I.
CoRR, 2022

On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions.
Proceedings of the International Conference on Machine Learning, 2022

Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering.
Proceedings of the International Conference on Machine Learning, 2022

Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Exact Community Recovery over Signed Graphs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Computing D-Stationary Points of ρ-Margin Loss SVM.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
A Penalty Alternating Direction Method of Multipliers for Convex Composite Optimization Over Decentralized Networks.
IEEE Trans. Signal Process., 2021

Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning.
IEEE Trans. Signal Process., 2021

A Newton Tracking Algorithm With Exact Linear Convergence for Decentralized Consensus Optimization.
IEEE Trans. Signal Inf. Process. over Networks, 2021

Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods.
SIAM J. Optim., 2021

Voting-Based Multiagent Reinforcement Learning for Intelligent IoT.
IEEE Internet Things J., 2021

Accelerating Perturbed Stochastic Iterates in Asynchronous Lock-Free Optimization.
CoRR, 2021

Learning Graphs from Smooth Signals under Moment Uncertainty.
CoRR, 2021

Quartic Perturbation-based Outage-constrained Robust Design in Two-hop One-way Relay Networks.
CoRR, 2021

Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method.
Proceedings of the 38th International Conference on Machine Learning, 2021

An Efficient Alternating Direction Method for Graph Learning from Smooth Signals.
Proceedings of the IEEE International Conference on Acoustics, 2021

Sparse High-Order Portfolios Via Proximal Dca And Sca.
Proceedings of the IEEE International Conference on Acoustics, 2021

A Theoretical Analysis of the Repetition Problem in Text Generation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Nonconvex Optimization for Signal Processing and Machine Learning [From the Guest Editors].
IEEE Signal Process. Mag., 2020

Understanding Notions of Stationarity in Nonsmooth Optimization: A Guided Tour of Various Constructions of Subdifferential for Nonsmooth Functions.
IEEE Signal Process. Mag., 2020

A Provably Convergent Projected Gradient-Type Algorithm for TDOA-Based Geolocation Under the Quasi-Parabolic Ionosphere Model.
IEEE Signal Process. Lett., 2020

Nonconvex Robust Low-Rank Matrix Recovery.
SIAM J. Optim., 2020

Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold.
SIAM J. Optim., 2020

An Integrated Approach of Machine Learning and Systems Thinking for Waiting Time Prediction in an Emergency Department.
Int. J. Medical Informatics, 2020

A Unified Approach to Synchronization Problems over Subgroups of the Orthogonal Group.
CoRR, 2020

Understanding Notions of Stationarity in Non-Smooth Optimization.
CoRR, 2020

Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst-Case Rates.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Low-Cost Lipschitz-Independent Adaptive Importance Sampling of Stochastic Gradients.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Penalty Alternating Direction Method of Multipliers for Decentralized Composite Optimization.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

An Efficient Augmented Lagrangian-Based Method for Linear Equality-Constrained Lasso.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

A Fast Proximal Point Algorithm for Generalized Graph Laplacian Learning.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

A Newton Tracking Algorithm with Exact Linear Convergence Rate for Decentralized Consensus Optimization.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

Dynamic Regret Bound for Moving Target Tracking Based on Online Time-of-Arrival Measurements.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019
A Framework for One-Bit and Constant-Envelope Precoding Over Multiuser Massive MISO Channels.
IEEE Trans. Signal Process., 2019

Another Look at Anonymous Communication.
IEEE Trans. Dependable Secur. Comput., 2019

On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition.
SIAM J. Optim., 2019

A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property.
Math. Program., 2019

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods.
Math. Program., 2019

Nonsmooth Optimization over Stiefel Manifold: Riemannian Subgradient Methods.
CoRR, 2019

A First-Order Algorithmic Framework for Wasserstein Distributionally Robust Logistic Regression.
CoRR, 2019

Incremental Methods for Weakly Convex Optimization.
CoRR, 2019

Voting-Based Multi-Agent Reinforcement Learning.
CoRR, 2019

An Efficient Augmented Lagrangian Based Method for Constrained Lasso.
CoRR, 2019

A First-Order Algorithmic Framework for Distributionally Robust Logistic Regression.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Globally Convergent Accelerated Proximal Alternating Maximization Method for L1-Principal Component Analysis.
Proceedings of the IEEE International Conference on Acoustics, 2019

Fast First-order Methods for the Massive Robust Multicast Beamforming Problem with Interference Temperature Constraints.
Proceedings of the IEEE International Conference on Acoustics, 2019

2018
Online Nonlinear AUC Maximization for Imbalanced Data Sets.
IEEE Trans. Neural Networks Learn. Syst., 2018

Minimum Symbol Error Rate-Based Constant Envelope Precoding for Multiuser Massive Miso Downlink.
Proceedings of the 2018 IEEE Statistical Signal Processing Workshop, 2018

Mixed-Integer Semidefinite Relaxation of Joint Admission Control and Beamforming: An SOC-Based Outer Approximation Approach with Provable Guarantees.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

LPA-SD: An Efficient First-Order Method for Single-Group Multicast Beamforming.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Geolocation of Unknown Emitters Using Tdoa of Path Rays Through the Ionosphere by Multiple Coordinated Distant Receivers.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

2017
Distributionally Robust Collaborative Beamforming in D2D Relay Networks With Interference Constraints.
IEEE Trans. Wirel. Commun., 2017

Semidefinite Relaxation and Approximation Analysis of a Beamformed Alamouti Scheme for Relay Beamforming Networks.
IEEE Trans. Signal Process., 2017

Unraveling the Rank-One Solution Mystery of Robust MISO Downlink Transmit Optimization: A Verifiable Sufficient Condition via a New Duality Result.
IEEE Trans. Signal Process., 2017

Scalable and Flexible Multiview MAX-VAR Canonical Correlation Analysis.
IEEE Trans. Signal Process., 2017

On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization.
SIAM J. Optim., 2017

Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity.
Optim. Methods Softw., 2017

A unified approach to error bounds for structured convex optimization problems.
Math. Program., 2017

A discrete first-order method for large-scale MIMO detection with provable guarantees.
Proceedings of the 18th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2017

LDPC code design for Gaussian multiple-access channels using dynamic EXIT chart analysis.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

SDR approximation bounds for the robust multicast beamforming problem with interference temperature constraints.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Scalable and flexible Max-Var generalized canonical correlation analysis via alternating optimization.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Local strong convexity of maximum-likelihood TDOA-Based source localization and its algorithmic implications.
Proceedings of the 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2017

2016
A Stochastic Beamformed Amplify-and-Forward Scheme in a Multigroup Multicast MIMO Relay Network With Per-Antenna Power Constraints.
IEEE Trans. Wirel. Commun., 2016

Robust Convex Approximation Methods for TDOA-Based Localization Under NLOS Conditions.
IEEE Trans. Signal Process., 2016

A Robust Design for MISO Physical-Layer Multicasting Over Line-of-Sight Channels.
IEEE Signal Process. Lett., 2016

Low-Rank Semidefinite Programming: Theory and Applications.
Found. Trends Optim., 2016

Some Proof Derivations and Further Simulation Results for "Semidefinite Relaxation and Approximation Analysis of a Beamformed Alamouti Scheme for Relay Beamforming Networks".
CoRR, 2016

Another Look at Anonymous Communication - Security and Modular Constructions.
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

Distributionally Robust Relay Beamforming in Wireless Communications.
Proceedings of the 19th ACM International Conference on Modeling, 2016

Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods.
Proceedings of the 33nd International Conference on Machine Learning, 2016

A semidefinite relaxation approach to the geolocation of two unknown co-channel emitters by a cluster of formation-flying satellites using both TDOA and FDOA measurements.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

A polynomial optimization approach for robust beamforming design in a device-to-device two-hop one-way relay network.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

Robust Relay Beamforming in Device-to-Device Networks with Energy Harvesting Constraints.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Rank-Two Beamforming and Stochastic Beamforming for MISO Physical-Layer Multicasting with Finite-Alphabet Inputs.
IEEE Signal Process. Lett., 2015

Stochastic amplify-and-forward schemes for multigroup multicast transmission in a distributed relay network.
Proceedings of the 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2015

\(\ell_{1, p}\)-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods.
Proceedings of the 32nd International Conference on Machine Learning, 2015

A beamformed alamouti amplify-and-forward scheme in multigroup multicast cloud-relay networks.
Proceedings of the 2015 IEEE International Conference on Acoustics, 2015

Kernelized Online Imbalanced Learning with Fixed Budgets.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Outage Constrained Robust Transmit Optimization for Multiuser MISO Downlinks: Tractable Approximations by Conic Optimization.
IEEE Trans. Signal Process., 2014

A Safe Approximation Approach to Secrecy Outage Design for MIMO Wiretap Channels.
IEEE Signal Process. Lett., 2014

Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems.
Math. Oper. Res., 2014

Robust transmit designs for an energy harvesting multicast system.
Proceedings of the IEEE International Conference on Acoustics, 2014

Robust beamforming in two-way relay networks: Quartically perturbed chance constrained formulation and tractable approximation.
Proceedings of the IEEE International Conference on Acoustics, 2014

Distributionally robust chance-constrained transmit beamforming for multiuser MISO downlink.
Proceedings of the IEEE International Conference on Acoustics, 2014

Robust artificial noise-aided transmit optimization for achieving secrecy and energy harvesting.
Proceedings of the IEEE International Conference on Acoustics, 2014

Latent Aspect Mining via Exploring Sparsity and Intrinsic Information.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
Physical-Layer Multicasting by Stochastic Transmit Beamforming and Alamouti Space-Time Coding.
IEEE Trans. Signal Process., 2013

Distributionally Robust Slow Adaptive OFDMA with Soft QoS via Linear Programming.
IEEE J. Sel. Areas Commun., 2013

Achievable Rate Derivations and Further Simulation Results for "Physical-Layer Multicasting by Stochastic Transmit Beamforming and Alamouti Space-Time Coding".
CoRR, 2013

Non-Asymptotic Convergence Analysis of Inexact Gradient Methods for Machine Learning Without Strong Convexity.
CoRR, 2013

On the Linear Convergence of the Proximal Gradient Method for Trace Norm Regularization.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Multi-group multicast beamforming in cognitive radio networks via rank-two transmit beamformed Alamouti space-time coding.
Proceedings of the IEEE International Conference on Acoustics, 2013

2012
Linear Matrix Inequalities with Stochastically Dependent Perturbations and Applications to Chance-Constrained Semidefinite Optimization.
SIAM J. Optim., 2012

A Perturbation Inequality for the Schatten-$p$ Quasi-Norm and Its Applications to Low-Rank Matrix Recovery
CoRR, 2012

Learning with Partially Absorbing Random Walks.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Rank-two transmit beamformed Alamouti space-time coding for physical-layer multicasting.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
Moment inequalities for sums of random matrices and their applications in optimization.
Math. Program., 2011

Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems.
Math. Program., 2011

Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming.
IEEE J. Sel. Areas Commun., 2011

Probabilistic SINR constrained robust transmit beamforming: A Bernstein-type inequality based conservative approach.
Proceedings of the IEEE International Conference on Acoustics, 2011

Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent.
Proceedings of the IEEE International Conference on Acoustics, 2011

Safe convex approximation to outage-based MISO secrecy rate optimization under imperfect CSI and with artificial noise.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010
Slow adaptive OFDMA systems through chance constrained programming.
IEEE Trans. Signal Process., 2010

Semidefinite Relaxation of Quadratic Optimization Problems.
IEEE Signal Process. Mag., 2010

Universal Rigidity and Edge Sparsification for Sensor Network Localization.
SIAM J. Optim., 2010

Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Probabilistic analysis of SDR detectors for MIMO systems.
Proceedings of the Convex Optimization in Signal Processing and Communications., 2010

2009
Graph Realization via Semidefinite Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level.
Math. Oper. Res., 2009

Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit
CoRR, 2009

Improved approximation bound for quadratic optimization problems with orthogonality constraints.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Fast Graph Laplacian Regularized Kernel Learning via Semidefinite-Quadratic-Linear Programming.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

On the performance of semidefinite relaxation MIMO detectors for QAM constellations.
Proceedings of the IEEE International Conference on Acoustics, 2009

2008
A Unified Theorem on SDP Rank Reduction.
Math. Oper. Res., 2008

2007
Greedy Algorithms for Metric Facility Location Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A semidefinite programming approach to the graph realization problem : theory, applications and extensions.
PhD thesis, 2007

Mechanism design for stochastic optimization problems.
SIGecom Exch., 2007

On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program., 2007

Theory of semidefinite programming for Sensor Network Localization.
Math. Program., 2007

Pari-Mutuel Markets: Mechanisms and Performance.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Stochastic Mechanism Design.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
A semidefinite programming approach to tensegrity theory and realizability of graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Supporting group communication among interacting agents in wireless sensor networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005


  Loading...