Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enlarging the region of convergence of Newton's method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sequential quadratic programming method / 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: Exact penalty function algorithm with simple updating of the penalty parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for extremum, penalty functions and regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for nonlinearly constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a new trust region algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified SQP method and its global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified SQP method with nonmonotone linesearch technique. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential penalty algorithm for nonlinear 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: A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for inconsistent QP problems in the SQP method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified projection algorithm for large strictly-convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonmonotone line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank

Latest revision as of 22:21, 27 June 2024

scientific article
Language Label Description Also known as
English
Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
scientific article

    Statements

    Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (English)
    0 references
    0 references
    28 April 2008
    0 references
    nonlinear programming problem
    0 references
    sequential quadratic programming
    0 references
    convex quadratic programming
    0 references
    computer code
    0 references
    algorithm
    0 references
    global convergence
    0 references
    nonmonotone line search
    0 references
    Maratos effect
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references