A class of quadratic programs with linear complementarity constraints
From MaRDI portal
Recommendations
- On convex quadratic programs with linear complementarity constraints
- scientific article; zbMATH DE number 757652
- A quadratic programming view of the linear complementary problem
- Quadratic programming problems and related linear complementarity problems
- Linear complementarity procedures in quadratic programming
- scientific article; zbMATH DE number 57066
- On linear programs with linear complementarity constraints
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- scientific article; zbMATH DE number 3945904
- scientific article; zbMATH DE number 3871035
Cites work
- scientific article; zbMATH DE number 1306970 (Why is no real title available?)
- scientific article; zbMATH DE number 1059222 (Why is no real title available?)
- A nonsmooth version of Newton's method
- An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- Approximation of a nondifferentiable nonlinear problem related to MHD equilibria
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- FINITE DIFFERENCE SMOOTHING SOLUTIONS OF NONSMOOTH CONSTRAINED OPTIMAL CONTROL PROBLEMS
- Finite element approximation of a nonlinear eigenvalue problem related to MHD equilibria
- First Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems
- Implicit Runge–Kutta Methods for Lipschitz Continuous Ordinary Differential Equations
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Matrix Analysis
- Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Numerical methods for reaction-diffusion problems with non-differentiable kinetics
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Optimization and nonsmooth analysis
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
Cited in
(17)- On quasiblock discrete programming problems with supplementary constraints
- Conic approximation to quadratic optimization with linear complementarity constraints
- On conic QPCCs, conic QCQPs and completely positive programs
- On alternative optimal solutions to quasimonotonic programming with linear constraints
- LCQPow: a solver for linear complementarity quadratic programs
- A note on a quadratic formulation for linear complementarity problems
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- Compact linearization for binary quadratic problems subject to assignment constraints
- scientific article; zbMATH DE number 3988071 (Why is no real title available?)
- Direct pseudo-spectral method for optimal control of obstacle problem-an optimal control problem governed by elliptic variational inequality
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
- On convex quadratic programs with linear complementarity constraints
- Newton-type method for a class of mathematical programs with complementarity constraints
- A note on composite concave quadratic programming
- The C-index: a new stability concept for quadratic programs with complementarity constraints
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
This page was built for publication: A class of quadratic programs with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833022)
