On methods for solving nonlinear semidefinite optimization problems
Access Status
Authors
Date
2011Type
Metadata
Show full item recordCitation
Source Title
ISSN
Remarks
This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Numerical Algebra, Control and Optimization following peer review. The definitive publisher-authenticated version Sun, J. 2011. On methods for solving nonlinear semidefinite optimization problems. Numerical Algebra, Control and Optimization. 1: pp. 1-14.is available online at: http://doi.org/10.3934/naco.2011.1.1
Collection
Abstract
The nonlinear semidefinite optimization problem arises from applications in system control, structural design, financial management, and other fields. However, much work is yet to be done to effectively solve this problem. We introduce some new theoretical and algorithmic development in this field. In particular, we discuss first and second-order algorithms that appear to be promising, which include the alternating direction method, the augmented Lagrangian method, and the smoothing Newton method. Convergence theorems are presented and preliminary numerical results are reported.
Related items
Showing items related by title, author, creator and subject.
-
Chow, Chi Ngok (2010)The largest wool exporter in the world is Australia, where wool being a major export is worth over AUD $2 billion per year and constitutes about 17 per cent of all agricultural exports. Most Australian wool is sold by ...
-
Woloszynski, T.; Podsiadlo, P.; Stachowiak, Gwidon (2015)Efficient numerical methods are essential in the analysis of finite hydrodynamic bearings with surface texturing. This is especially evident in optimization and parametric studies where the discretization and integration ...
-
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...