An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / 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: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new continuation method for complementarity problems with uniform P- functions / 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: An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the center of a convex quadratically constrained set / 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: A nonsmooth version of Newton's method / 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: Q3975058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global ellipsoidal approximations and homotopy methods for solving convex analytic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimizing convex functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank

Latest revision as of 11:15, 22 May 2024

scientific article
Language Label Description Also known as
English
An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
scientific article

    Statements

    An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (English)
    0 references
    0 references
    0 references
    0 references
    6 January 1994
    0 references
    0 references
    convergence analysis
    0 references
    path-following algorithm
    0 references
    convex programs
    0 references
    nonsmooth Newton subroutine
    0 references
    interior point methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references