An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOQO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MersenneTwister / rank
 
Normal rank
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.1007/s10589-007-9048-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970065252 / 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: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start of the primal-dual method applied in the cutting-plane scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization With the Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / 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: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complex Zeros of Random Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOQO:an interior point code for quadratic programming / 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: Warm-Start Strategies in Interior-Point Methods for Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:17, 27 June 2024

scientific article
Language Label Description Also known as
English
An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
scientific article

    Statements

    An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (English)
    0 references
    0 references
    0 references
    12 March 2008
    0 references
    Interior-point methods
    0 references
    Linear programming
    0 references
    Warmstarting
    0 references
    Penalty methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers