The Newton modified barrier method for QP problems (Q1915923): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Aaron Melman / rank
 
Normal rank
Property / author
 
Property / author: Roman A. Polyak / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / 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: 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: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of a modified barrier method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear rescaling and proximal-like methods in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified complexity analysis for Newton LP methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02206827 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038435941 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
The Newton modified barrier method for QP problems
scientific article

    Statements

    The Newton modified barrier method for QP problems (English)
    0 references
    3 November 1996
    0 references
    modified barrier functions
    0 references
    hot start
    0 references
    relaxation operator
    0 references
    Newton MBF method
    0 references
    second-order optimality conditions
    0 references
    Lagrange multipliers
    0 references
    condition number
    0 references
    0 references
    0 references

    Identifiers