Algorithms for linear programming with linear complementarity constraints (Q1935876): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q400081
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Joaquim Joao Júdice / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MacMPEC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / 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/s11750-011-0228-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043610587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit enumeration procedure for the general linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms, penalty methods and equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of global algorithms for linear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing method for mathematical programs with equilibrium constraints / 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: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP / 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: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / 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: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—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: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental investigation of enumerative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of LCP methods for bilinear and concave quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential LCP method for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear-Quadratic Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution and complexity of a generalized linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints / 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: On solving linear complementarity problems by DC programming and DCA / 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: The linear complementarity problem as a separable bilinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints / 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: Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for Optimization Problems with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem / rank
 
Normal rank

Latest revision as of 04:37, 6 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for linear programming with linear complementarity constraints
scientific article

    Statements

    Algorithms for linear programming with linear complementarity constraints (English)
    0 references
    0 references
    20 February 2013
    0 references
    complementarity problems
    0 references
    global optimization
    0 references
    nonlinear programming
    0 references
    mathematical programming with linear complementarity constraints
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers