Newton-KKT interior-point methods for indefinite quadratic programming (Q885826): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A truncated-CG style method for symmetric generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The trust region affine interior point algorithm for convex and nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for the Solution of Algebraic Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method based on interior point techniques for nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Interior Point Algorithm for Linearly Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior Newton method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A barrier function method for the nonconvex quadratic programming problem with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Methods for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of penalty/barrier path-following Newton methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bound constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some interior-point algorithms for nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent primal-dual interior point method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On affine scaling algorithms for nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating a KKT point of quadratic programming / 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: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank

Revision as of 09:06, 26 June 2024

scientific article
Language Label Description Also known as
English
Newton-KKT interior-point methods for indefinite quadratic programming
scientific article

    Statements

    Newton-KKT interior-point methods for indefinite quadratic programming (English)
    0 references
    14 June 2007
    0 references
    interior-point algorithms
    0 references
    primal-dual algorithms
    0 references
    Newton-KKT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers