An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161456
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Pu, Dingguo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ipfilter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40314-013-0109-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077961923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840764 / 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: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and local convergence of a class of penalty-free-type methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Accurate Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and local convergence of a filter line search method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a robust filter SQP algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Active Set QP-Free Method for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Regular Generalized Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential systems of linear equations method for general constrained optimization without strict complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 00:25, 10 July 2024

scientific article
Language Label Description Also known as
English
An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
scientific article

    Statements

    An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2015
    0 references
    infeasible QP-free method
    0 references
    penalty-function-free
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers