A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone line search algorithm for constrained minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained min-max algorithm for rival models of the same economic system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone line search for minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised monotone line search algorithm for degenerate nonlinear minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new superlinearly convergent SQP algorithm for nonlinear minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized monotone line search SQP algorithm for constrained minimax problems / 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: 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: Quadratically constraint quadratical algorithm model for nonlinear minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems / 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: Smoothing method for minimax problems / rank
 
Normal rank

Latest revision as of 07:58, 13 July 2024

scientific article
Language Label Description Also known as
English
A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
scientific article

    Statements

    A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2017
    0 references
    constrained minimax problems
    0 references
    norm-relaxed SQP method
    0 references
    method of quasi-strongly sub-feasible directions
    0 references
    system of linear equations
    0 references
    global and superlinear convergence
    0 references
    0 references
    0 references

    Identifiers