Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimality conditions for nonsmooth semidefinite programming via convexificators

Optimality conditions for nonsmooth semidefinite programming via convexificators This study is devoted to the semidefinite optimization problems with inequality constraints. We use the notion of convexificators to establish optimality conditions for nonsmooth semidefinite optimization problems. Moreover, we introduce appropriate constraint qualifications to present the Karush–Kuhn–Tucker multipliers. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Positivity Springer Journals

Optimality conditions for nonsmooth semidefinite programming via convexificators

Positivity , Volume 19 (2) – Jun 3, 2014

Loading next page...
1
 
/lp/springer_journal/optimality-conditions-for-nonsmooth-semidefinite-programming-via-wznAW8sO4B

References (31)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Springer Basel
Subject
Mathematics; Fourier Analysis; Operator Theory; Potential Theory; Calculus of Variations and Optimal Control; Optimization; Econometrics
ISSN
1385-1292
eISSN
1572-9281
DOI
10.1007/s11117-014-0292-6
Publisher site
See Article on Publisher Site

Abstract

This study is devoted to the semidefinite optimization problems with inequality constraints. We use the notion of convexificators to establish optimality conditions for nonsmooth semidefinite optimization problems. Moreover, we introduce appropriate constraint qualifications to present the Karush–Kuhn–Tucker multipliers.

Journal

PositivitySpringer Journals

Published: Jun 3, 2014

There are no references for this article.