An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Image d'une somme d'opérateurs monotones et applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal minimization algorithm with \(D\)-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of the exponential penalty trajectory in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative iterative algorithms for convex 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: Interior point algorithms for linear programming with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / 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: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy-Like Proximal Methods in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming / 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: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation des méthodes d'optimisation. Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal domain of a ''monotone'' function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic 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: On the Maximality of Sums of Nonlinear Monotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trajectory-following polynomial-time algorithm for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming / 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

Latest revision as of 14:11, 24 May 2024

scientific article
Language Label Description Also known as
English
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
scientific article

    Statements

    An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (English)
    0 references
    0 references
    0 references
    24 November 1996
    0 references
    convex linearly constrained problems
    0 references
    maximal monotone operator
    0 references
    entropy-like proximal method
    0 references
    minimization of a convex function
    0 references
    interior algorithm
    0 references
    variational inequalities on polyhedra
    0 references
    0 references
    0 references
    0 references

    Identifiers