A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / 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.1080/02331934.2011.611514 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022619808 / 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 Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential quadratically constrained quadratic programming method of feasible directions / 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: Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions / 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 type of efficient feasible SQP algorithms for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of 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 surperlinearly convergent algorithm for constrained optimization problems / 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: On the Sequential Quadratically Constrained Quadratic Programming Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function / rank
 
Normal rank

Latest revision as of 16:35, 6 July 2024

scientific article
Language Label Description Also known as
English
A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
scientific article

    Statements

    A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    sequential quadratically constrained quadratic programming
    0 references
    systems of linear equations
    0 references
    strongly sub-feasible directions
    0 references
    second-order approximate condition
    0 references
    global convergence
    0 references
    rate of convergence
    0 references
    0 references