An interior-point trust-funnel algorithm for nonlinear optimization (Q507313): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-016-1003-9 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GALAHAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CQP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333358170 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58185646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact SQP Method for Equality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method based on interior point techniques for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Large-Scale Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Convergence of a Filter--SQP Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving symmetric indefinite systems in an interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual trust region algorithm for nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods 25 years later / rank
 
Normal rank
Property / cites work
 
Property / cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Derivative SQP Method: Global Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Derivative SQP Method: Local Convergence and Practical Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-derivative SQP method with a 'trust-region-free' predictor step / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving trust-region and other regularised subproblems in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function or a filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential quadratic programming algorithm with an additional equality constrained phase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trajectory-following methods for large-scale degenerate convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOQO:an interior point code for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-016-1003-9 / rank
 
Normal rank

Latest revision as of 19:46, 9 December 2024

scientific article
Language Label Description Also known as
English
An interior-point trust-funnel algorithm for nonlinear optimization
scientific article

    Statements

    An interior-point trust-funnel algorithm for nonlinear optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2017
    0 references
    The authors present an interior-point trust-funnel algorithm for solving large-scale nonlinear optimization problems. The given algorithm 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. A flow diagram of the given trust-funnel algorithm is presented.
    0 references
    0 references
    nonlinear optimization
    0 references
    funnel mechanism
    0 references
    trust-region methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references