Infeasible constraint-reduced interior-point methods for linear optimization (Q5200562): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/10556788.2011.589056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009249377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms, penalty methods and equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained control and estimation. An optimisation approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Methods for Mathematical Programs with Complementarity Constraints / 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: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of a primal affine scaling method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scaled projections and pseudoinverses / 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: 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: An active-set strategy in an interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``build-down'' scheme for linear programming / rank
 
Normal rank

Latest revision as of 20:59, 5 July 2024

scientific article; zbMATH DE number 6102487
Language Label Description Also known as
English
Infeasible constraint-reduced interior-point methods for linear optimization
scientific article; zbMATH DE number 6102487

    Statements

    Infeasible constraint-reduced interior-point methods for linear optimization (English)
    0 references
    0 references
    0 references
    6 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    constraint reduction
    0 references
    infeasible initial points
    0 references
    interior-point methods
    0 references
    linear programming
    0 references
    many constraints
    0 references
    0 references
    0 references
    0 references