An inexact SQP Newton method for convex SC1 minimization problems
Master's
Saved in:
Main Author: | CHEN YIDI |
---|---|
Other Authors: | MATHEMATICS |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/16623 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems
by: JIANG KAIFENG
Published: (2012) -
A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
by: Huang, Z.-H., et al.
Published: (2014) -
Superlinear convergence of a Newton-type algorithm for monotone equations
by: Zhou, G., et al.
Published: (2014) -
An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
by: Jiang, K., et al.
Published: (2014) -
Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 - And monotone LCP
by: Huang, Z.-H., et al.
Published: (2014)