On Duality Theory for Non-Convex Semidefinite Programming

Annals of Operations Research - Netherlands
doi 10.1007/s10479-011-0861-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

On Duality Theory of Convex Semi-Infinite Programming

Optimization
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2005English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Duality Theorems for Convex Programming Without Constraint Qualification

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1984English

A Duality Theorem for Nondifferentiable Convex Programming With Operatorial Constraints

Bulletin of the Australian Mathematical Society
Mathematics
1980English

Semidefinite Programming

2014English

Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

Regularization Methods for Semidefinite Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2009English

Inference on Graphs via Semidefinite Programming

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy