Name
Abstract | ||
|---|---|---|
We present an interior-point trust-funnel algorithm for solving large-scale nonlinear optimization problems. The method is based on an approach proposed by Gould and Toint (Math Prog 122(1):155---196, 2010) that focused on solving equality constrained problems. Our method is similar in that it achieves global convergence guarantees by combining a trust-region methodology with a funnel mechanism, but has the additional capability of being able to solve problems with both equality and inequality constraints. The prominent features of our algorithm are that (i) the subproblems that define each search direction may be solved with matrix-free methods so that derivative matrices need not be formed or factorized so long as matrix-vector products with them can be performed; (ii) the subproblems may be solved approximately in all iterations; (iii) in certain situations, the computed search directions represent inexact sequential quadratic optimization steps, which may be desirable for fast local convergence; (iv) criticality measures for feasibility and optimality aid in determining whether only a subset of computations need to be performed during a given iteration; and (v) no merit function or filter is needed to ensure global convergence. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10107-016-1003-9 | Mathematical Programming: Series A and B |
Keywords | Field | DocType |
Nonlinear optimization, Constrained optimization, Large-scale optimization, Barrier-SQP methods, Trust-region methods, Funnel mechanism, 49J52, 49M37, 65F22, 65K05, 90C26, 90C30, 90C55 | Mathematical optimization,Computer science,Nonlinear programming,Funnel,Interior point method | Journal |
Volume | Issue | ISSN |
161 | 1-2 | 0025-5610 |
Citations | PageRank | References |
1 | 0.35 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank E. Curtis | 1 | 432 | 25.71 |
| nim gould | 2 | 1 | 0.35 |
| Daniel P. Robinson | 3 | 261 | 21.51 |
| Ph. L. Toint | 4 | 927 | 197.61 |