A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(11 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.nonrwa.2011.03.017 / rank
Normal rank
 
Property / author
 
Property / author: Jin-Bao Jian / rank
Normal rank
 
Property / author
 
Property / author: Jin-Bao Jian / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SifDec / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEr / 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.1016/j.nonrwa.2011.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086926527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient feasible SQP algorithm for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the norm-relaxed method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent method of feasible directions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new SQP method of feasible directions for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization / 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: Q4665560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the accurate identification of active set for constrained minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.NONRWA.2011.03.017 / rank
 
Normal rank

Latest revision as of 23:15, 9 December 2024

scientific article
Language Label Description Also known as
English
A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
scientific article

    Statements

    A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (English)
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    constrained optimization
    0 references
    norm-relaxed SQP method
    0 references
    method of quasi-strongly sub-feasible directions
    0 references
    active set identification
    0 references
    global and superlinear convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers