A globally convergent primal-dual interior point algorithm for convex programming (Q1330897): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual to primal conversion in geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of Rosen's gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems / 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: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some efficient interior point methods for nonlinear convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of functions and feasibility conditions in nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path following algorithm for a class of convex programming problems / rank
 
Normal rank

Latest revision as of 17:16, 22 May 2024

scientific article
Language Label Description Also known as
English
A globally convergent primal-dual interior point algorithm for convex programming
scientific article

    Statements

    A globally convergent primal-dual interior point algorithm for convex programming (English)
    0 references
    0 references
    10 August 1994
    0 references
    0 references
    interior-point methods
    0 references
    Karmarkar's algorithm
    0 references
    potential reduction algorithms
    0 references
    global convergence
    0 references
    primal-dual interior point algorithms
    0 references
    linearly constrained convex programming
    0 references
    Armijo stepsize rule
    0 references
    convergence analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references