A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / 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/s10107-017-1208-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607956614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mathematical programs with complementarity constraints as nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Convergence of a Filter--SQP Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Use of Cuts in Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear complementarity problems by DC programming and DCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / 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: Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of general linear complementarity problems via nondifferentiable concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing B-Stationary Points of Nonsmooth DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank

Latest revision as of 15:05, 15 July 2024

scientific article
Language Label Description Also known as
English
A study of the difference-of-convex approach for solving linear programs with complementarity constraints
scientific article

    Statements

    A study of the difference-of-convex approach for solving linear programs with complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2018
    0 references
    difference-of-convex
    0 references
    complementarity constraints
    0 references
    penalty functions
    0 references
    bilevel programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers