On using exterior penalty approaches for solving linear programming problems (Q5945315): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable exponential-penalty algorithm with superlinear convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible (exterior point) simplex algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior point simplex algorithm for (general) linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exterior point algorithms for nearest points and convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior point method for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior-point method for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Penalty and Multiplier Methods for Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of convergent primal-dual subgradient algorithms for decomposable convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty/Barrier Multiplier Methods for Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs / rank
 
Normal rank

Latest revision as of 20:27, 3 June 2024

scientific article; zbMATH DE number 1656538
Language Label Description Also known as
English
On using exterior penalty approaches for solving linear programming problems
scientific article; zbMATH DE number 1656538

    Statements

    On using exterior penalty approaches for solving linear programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2001
    0 references
    0 references
    linear programming
    0 references
    penalty approach
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references