New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A surperlinearly convergent algorithm for constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive quadratic programming algorithm with global and superlinear convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations / 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: Q4391955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly and quadratically convergent SQP type feasible method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of a Class of Methods of Feasible Directions / 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

Latest revision as of 10:24, 26 June 2024

scientific article
Language Label Description Also known as
English
New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
scientific article

    Statements

    New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (English)
    0 references
    0 references
    21 June 2007
    0 references
    0 references
    inequality constraints
    0 references
    optimization
    0 references
    quadratic constraints
    0 references
    quadratic programming
    0 references
    convergence rate
    0 references
    0 references