First-order sequential convex programming using approximate diagonal QP subproblems

Title
First-order sequential convex programming using approximate diagonal QP subproblems
Authors
Keywords
-
Journal
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
Volume 45, Issue 4, Pages 479-488
Publisher
Springer Nature
Online
2011-11-28
DOI
10.1007/s00158-011-0739-3

Ask authors/readers for more resources

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now