A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-019-00058-0 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897905020 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.09243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-set prediction for interior point methods using controlled perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic regularizations in an interior-point method for primal block-angular problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Active Set QP-Free Method for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well definedness of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Accurate Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in the presence of degeneracy and error estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible constraint-reduced interior-point methods for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constraint reduction for training support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constraint reduction for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Filtered P$_N$ Moment Closures for Linear Kinetic Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time constraint-reduced algorithm for semidefinite optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / 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: Constraint Reduction for Linear Programs with Many Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active-set strategy in an interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint-reduced variant of Mehrotra's predictor-corrector algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying SQP for Degenerate Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``build-down'' scheme for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128296398 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-019-00058-0 / rank
 
Normal rank

Latest revision as of 12:49, 18 December 2024

scientific article
Language Label Description Also known as
English
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
scientific article

    Statements

    A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (English)
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    convex quadratic programming
    0 references
    constraint reduction
    0 references
    primal-dual interior-point method
    0 references
    Mehrotra's predictor-corrector
    0 references
    regularization
    0 references
    active constraints identification
    0 references
    0 references
    0 references
    0 references
    0 references
    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