scientific article

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computational complexity Lagrange multipliers gradient methods ellipsoid descent methods optimality results linear complementary Karmarkar algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Quadratic programming (90C20) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Methods of reduced gradient type (90C52) Mathematical programming (90C99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items

Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems, On the preconditioned GAOR method for a linear complementarity problem with an $M$-matrix, Topological fixed point theory and applications to variational inequalities, Fundamentals of cone regression, Convergence of SSOR methods for linear complementarity problems, A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems, SPN graphs: when copositive = SPN, Feasibility problems with complementarity constraints, A dual-based algorithm for solving lexicographic multiple objective programs, A new path-following algorithm for nonlinear $P_*$ complementarity problems, On critical capacity of arcs in a directed network, A modified damped Newton method for linear complementarity problems, Properties of some matrix classes based on principal pivot transform, A simplex algorithm for piecewise-linear fractional programming problems, On computer-assisted proofs for solutions of linear complementarity problems, A multiobjective based approach for mathematical programs with linear flexible constraints, A discrete element based simulation framework to investigate particulate spray deposition processes, Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem, Breast cancer prediction using the isotonic separation technique, A brief history of the international symposia on mathematical programming, Numerical solutions of a two-phase membrane problem, Efficient curve fitting: an application of multiobjective programming, On singular $N_{0}$-matrices and the class $Q$, On the optimal design of river fishways, On solving linear complementarity problems by DC programming and DCA, $P$-matrices and signed digraphs, Enumeration-based approach to solving parametric linear complementarity problems, Copositive optimization -- recent developments and applications, A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem, IGAOR and multisplitting IGAOR methods for linear complementarity problems, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, A DC programming approach for solving the symmetric eigenvalue complementarity problem, A projected-gradient interior-point algorithm for complementarity problems, Study of a piecewise linear dynamic system with negative and positive stiffness, A new $O(n^ 2)$ shortest chain algorithm, Oops! I cannot do it again: testing for recursive feasibility in MPC, A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics, Perturbation results for the linear complementarity problem, On the natural merit function for solving complementarity problems, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, Best $k$-digit rational approximation of irrational numbers: pre-computer versus computer era, On linear fractional programming problem and its computation using a neural network model, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, Incremental constraint deletion in systems of linear constraints, Cyclic games and linear programming, Weakly chained diagonally dominant $B$-matrices and error bounds for linear complementarity problems, Equivalence of equilibrium problems and least element problems, A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems, Constructive characterization of Lipschitzian $Q_ 0$-matrices, On a ``stability in the linear complementarity problem, Generalizations of the hidden Minkowski property, On a global projection-type error bound for the linear complementarity problem, A general preconditioner for linear complementarity problem with an $M$-matrix, A generalized proximal-point-based prediction-correction method for variational inequality problems, New error bounds for the linear complementarity problem of $QN$-matrices, Error bounds for linear complementarity problems of weakly chained diagonally dominant $B$-matrices, An alternative error bound for linear complementarity problems involving $B^{S}$-matrices, Issues in computing contact forces for non-penetrating rigid bodies, New error bounds for linear complementarity problems of Nekrasov matrices and $B$-Nekrasov matrices, Exterior point algorithms for nearest points and convex quadratic programs, A long-step barrier method for convex quadratic programming, A note on solvability of a class of linear complementarity problems, A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio, The nearest point problem in a polyhedral set and its extensions, Two-step modulus-based matrix splitting iteration method for linear complementarity problems, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, On the solution of NP-hard linear complementarity problems, Computation of the Nash equilibrium selected by the tracing procedure in $N$-person games, On the modulus algorithm for the linear complementarity problem., A new subclass of $P$-matrices, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, Multiobjective model predictive control, An iterative approach for cone complementarity problems for nonsmooth dynamics, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a $P$-matrix, A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints, The steepest descent gravitational method for linear programming, Imitation games and computation, Good hidden $P$-matrix sandwiches, A fast nonlinear conjugate gradient based method for 3D concentrated frictional contact problems, Existence theory and $Q$-matrix characterization for the generalized linear complementarity problem: Revisited, A strongly polynomial simplex method for the linear fractional assignment problem, Integer version of the multipath flow network synthesis problem, Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems, Conjugate gradient method for the linear complementarity problem withs-matrix, An MM Algorithm for Split Feasibility Problems, Optimization of extrapolated Cayley transform with non-Hermitian positive definite matrix, Error bounds for linear complementarity problems of $MB$-matrices, Determining maximal efficient faces in multiobjective linear programming problem, The block principal pivoting algorithm for the linear complementarity problem with an $M$-matrix, A parametric algorithm for convex cost network flow and related problems, Linear time algorithms for convex and monotone approximation, Efficient models for the facility layout problem, On total functions, existence theorems and computational complexity, A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems, Optimality criteria for general unconstrained geometric programming problems, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Note on error bounds for linear complementarity problems for $B$-matrices, A smoothing Broyden-like method for the mixed complementarity problems, An improved full-Newton step $O(n)$ infeasible interior-point method for horizontal linear complementarity problem, Some recent advances in projection-type methods for variational inequalities, On semimonotone matrices with nonnegative principal minors, An improved error bound for linear complementarity problems for $B$-matrices, New variants of the criss-cross method for linearly constrained convex quadratic programming, A generalized Newton method for non-Hermitian positive definite linear complementarity problem, On a class of semimonotone $Q_ 0$-matrices in the linear complementarity problem, Some new classes of general quasi variational inequalities, Fuzzy approximation to an infeasible generalized linear complementarity problem, On the convergence of two-step modulus-based matrix splitting iteration method, A new subclass of $Q_0$-matrix in linear complementarity theory, A class of new modulus-based matrix splitting methods for linear complementarity problem, Solution of linear complementarity problems using minimization with simple bounds, Existence theory and $Q$-matrix characterization for the generalized linear complementarity problem, On a subclass of $P_ 0$, Schur, Hermite-Hadamard, and Fejér type inequalities for the class of higher-order generalized convex functions, New modulus-based matrix splitting methods for implicit complementarity problem, A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept, Superfluous matrices in linear complementarity, Optimized scorings for ordinal data for the general linear model, The reduced order method for solving the linear complementarity problem with an $M$-matrix, $\varepsilon$-approximation minimization of convex functions in fixed dimension, Improved error bounds based on $\alpha (M)$ for the linear complementarity problem, Metamodelling techniques in multidimensional optimality analysis for linear programming, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, Algorithm implementation for distributed convex intersection computation, The $s$-monotone index selection rules for pivot algorithms of linear programming, Global uniqueness and solvability of tensor complementarity problems for $\mathcal{H}_+$-tensors, Algorithms for linear programming with linear complementarity constraints, Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems, An investigation of feasible descent algorithms for estimating the condition number of a matrix, Generalized SOR-like iteration method for linear complementarity problem, The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems, On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems, Linear complementarity problems and bi-linear games., On the generalized essential matrix correction: an efficient solution to the problem and its applications, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, A direct heuristic algorithm for linear programming, The refined error bounds for linear complementarity problems of $H_+$-matrices, Nonsmooth spatial frictional contact dynamics of multibody systems, A two-step modulus-based matrix splitting iteration method for solving nonlinear complementarity problems of $H_+$-matrices, A full-Newton step feasible interior-point algorithm for $P_\ast(\kappa)$-linear complementarity problems, An RLT approach for solving the binary-constrained mixed linear complementarity problem, The modulus-based matrix double splitting iteration method for linear complementarity problems, Schur complement-based infinity norm bounds for the inverse of SDD matrices, A Jacobian smoothing method for box constrained variational inequality problems, A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem, On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems, A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of $H$-matrices, MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems, Steady-state performance evaluation of continuous mono-T-semiflow Petri nets, Infimum of error bounds for linear complementarity problems of $\Sigma$-\textit{SDD} and $\Sigma_1$-\textit{SSD} matrices, A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems, Principal pivot transforms of some classes of matrices, Tensor complementarity problems. II: Solution methods, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach, Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming, Pricing American drawdown options under Markov models, A new error bound for linear complementarity problems with weakly chained diagonally dominant $B$-matrices, Modulus-based matrix splitting methods for horizontal linear complementarity problems, Note on error bounds for linear complementarity problems of Nekrasov matrices, A continuation algorithm for a class of linear complementarity problems using an extrapolation technique, Note on combinatorial optimization with max-linear objective functions, The linear complementarity problem as a separable bilinear program, An iteration method for nonlinear complementarity problems, On the unique solution of the generalized absolute value equation, On the structure of linear programs with overlapping cardinality constraints, The almost semimonotone matrices, The generalized linear complementarity problem revisited, On finite termination of an iterative method for linear complementarity problems, A class of smoothing functions for nonlinear and mixed complementarity problems, On the resolution of monotone complementarity problems, A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix, $P_ c$-matrices and the linear complementarity problem, Fast finite methods for a system of linear inequalities, A primal-dual subgradient method for time staged capacity expansion planning, Global error bounds for the tensor complementarity problem with a $P$-tensor, Efficient parallel linear programming, On ${\mathbb{K}}^{\Delta}$, An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment, On the $\epsilon$-perturbation method for avoiding degeneracy, On totally dual integral systems, A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems, Semimonotone matrices, Complexity aspects of local minima and related notions, A good submatrix is hard to find, Some NP-complete problems in linear programming, On semimonotone matrices, $R_0$-matrices and $Q$-matrices, Fast modulus-based matrix splitting iteration methods for implicit complementarity problems, Parameterized error bounds for linear complementarity problems of $B_\pi ^R$-matrices and their optimal values, A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of $H_+$-matrices, On independent cliques and linear complementarity problems, Projection onto simplicial cones by a semi-smooth Newton method, The PMCGAOR and PMCSSOR methods for solving linear complementarity problems, Projection onto simplicial cones by Picard's method, The modulus-based nonsmooth Newton's method for solving linear complementarity problems, On the equivalence of linear complementarity problems, Model transform and local parameters. Application to instantaneous attractors, A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases, Minimax linear programming problem, The modulus-based nonsmooth Newton's method for solving a class of nonlinear complementarity problems of $P$-matrices, A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices, On combined minmax-minsum optimization, Solving a class of network models for dynamic flow control, A nonsmooth Newton method for variational inequalities. II: Numerical results, On the solution of linear programming problems with free (unrestricted) variables, A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of $H$-matrices, Fast convergence of an inexact interior point method for horizontal complementarity problems, The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems, The linear complementarity problem and a subclass of fully semimonotone matrices, Strongly polynomial algorithm for a class of combinatorial LCPs, Error bounds for inconsistent linear inequalities and programs, New characterizations of $\ell_ 1$ solutions to overdetermined systems of linear equations, Reducing a monotone horizontal LCP to an LCP, A new simple homotopy algorithm for linear programming. I, Two characterization theorems in complementarity theory, Branch-and-cut for linear programs with overlapping SOS1 constraints, Modulus-based matrix splitting algorithms for the quasi-complementarity problems, On Lipschitzian $Q_ 0$ and INS matrices, Evolution of plastic anisotropy for high-strain-rate computations, FE-formulation of a nonlocal plasticity theory, Computing complex chemical equilibria by generalized linear programming, The k most vital arcs in the shortest path problem, On the connectedness of solution sets in linear complementarity problems, Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, Special cases of the quadratic assignment problem, Ratio combinatorial programs, An O(n) algorithm for discrete n-point convex approximation with applications to continuous case, On a new class of bilevel programming problems and its use for reformulating mixed integer problems, A bilevel bottleneck programming problem, EP theorems and linear complementarity problems, Efficient computation of multiple solutions in quasibrittle fracture analysis, Error bounds for linear complementarity problems of $S$-Nekrasov matrices and $B$-$S$-Nekrasov matrices, Improved convergence theorems of modulus-based matrix splitting iteration method for nonlinear complementarity problems of $H$-matrices, Completely mixed strategies for generalized bimatrix and switching controller stochastic game, A time minimising transportation problem with quantity dependent time, The set of limiting distributions for a Markov chain with fuzzy transition probabilities, A set-valued force law for spatial Coulomb--Contensou friction., On the bottleneck linear programming problem, The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems, A preview of a tolerance approach to sensitivity analysis in linear programming, The sign-based methods for solving a class of nonlinear complementarity problems, The equivalence of an LCP to a parametric linear program with a scalar parameter, Copositive-plus Lemke algorithm solves polymatrix games, An $O(n^ 3L)$ adaptive path following algorithm for a linear complementarity problem, An infinity norm bound for the inverse of Dashnic-Zusmanovich type matrices with applications, A generalization of the Gauss-Seidel iteration method for solving absolute value equations, A note on a characterization of $P$-matrices, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, A sequential LCP method for bilevel linear programming, Two characterizations of sufficient matrices, Global error bounds for monotone affine variational inequality problems, Lagrangean duality for facial programs with applications to integer and complementarity problems, Crashing a maximum-weight complementary basis, Minimax resource allocation problems: Optimization and parametric analysis, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, A new exact approach for the 0-1 collapsing knapsack problem, The job shop scheduling problem with convex costs, An algorithm for computing all solutions of an absolute value equation, Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints, Path following and critical points for contact problems, Description of the optimal solution set of the linear programming problem and the dimension formula, Concave cost minimization on networks, The linear complementarity problem, sufficient matrices, and the criss- cross method, A min-max resource allocation problem with substitutions, Optimizing flow rates in a queueing network with side constraints, Optimal expansion of capacitated transshipment networks, LP relaxation of the two dimensional knapsack problem with box and GUB constraints, Modeling and algorithm on a class of mechanical systems with unilateral constraints, Multi-commodity supply network planning in the forest supply chain, Dynamic lot-sizing with setup cost reduction, The balanced linear programming problem, On the convergence of the block principal pivotal algorithm for the LCP, Solving stochastic complementarity problems in energy market modeling using scenario reduction, A test for copositive matrices, A new technique for inconsistent QP problems in the SQP method, On local $w$-uniqueness of solutions to linear complementarity problem, Worst case analysis of resistive networks using linear programming approach, Convex constrained programmes with unattained infima, Symbiosis between linear algebra and optimization, A note on composite concave quadratic programming, The generalized Leontief input-output model and its application to the choice of new technology, Cycling can occur in Mráz's algorithm for nonconvex quadratic programming, A class of sufficiently small friction coefficients for the uniqueness of the solution of the quasistatic contact problem., Pivot versus interior point methods: Pros and cons, Degeneracy in linear complementarity problems: A survey, Pivot rules for linear programming: A survey on recent theoretical developments, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, On the complexity of a special basis problem in LP, Generalized $P_ 0$- and $Z$-matrices, New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization, Strongly polynomial time algorithms for certain concave minimization problems on networks, MINOS(IIS): Infeasibility analysis using MINOS, Multiparametric demand transportation problem, On the complexity of a pivot step of the revised simplex algorithm, Criteria for copositive matrices of order four, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems, Hybrid extreme point tabu search, AN IMPROVED BLOCK MODULUS METHOD FOR DIAGONALLY DOMINANT LINEAR COMPLEMENTARITY PROBLEMS, Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit, More on matrix splitting modulus-based iterative methods for solving linear complementarity problem, State observers for the time discretization of a class of impulsive mechanical systems, A class of modulus-based matrix splitting methods for vertical linear complementarity problem, Modulus-based matrix splitting methods for complex linear complementarity problem, Equilibrium and surviving species in a large Lotka-Volterra system of differential equations, Quadratic programming with ramp functions and fast online QP-MPC solutions, Modulus-based matrix splitting iteration methods with new splitting scheme for horizontal implicit complementarity problems, Improved modulus-based matrix splitting iteration methods for quasi-complementarity problems, A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems, On the new modulus-based matrix splitting method for linear complementarity problem of $H_+$-matrix, A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems, Absorption paths and equilibria in quitting games, A smoothing inexact Newton method for nonlinear complementarity problems, Verification for existence of solutions of linear complementarity problems, On the classes of fully copositive and fully semimonotone matrices, $(0,k)$-epi mappings. Applications to complementarity theory, Complementarity problems, On project scheduling with irregular starting time costs, Cone of recession and unboundedness of convex functions, A copositivity probe, More on positive subdefinite matrices and the linear complementarity problem, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems, A wider convergence area for the MSTMAOR iteration methods for LCP, Copositivity tests based on the linear complementarity problem, Solvability of implicit complementarity problems, A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming, On hidden $\mathbf{Z}$-matrices and the linear complementarity problem, The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems, On SOR-like iteration methods for solving weakly nonlinear systems, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, On the numerical solution of the quadratic eigenvalue complementarity problem, Inexact multisplitting methods for linear complementarity problems, Modulus Methods for Nonnegatively Constrained Image Restoration, New error bounds for the linear complementarity problem with an $SB$-matrix, Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems, The symmetric eigenvalue complementarity problem, Quadratic programming is in NP, A new error bound for linear complementarity problems for B-matrices, Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings, On Relation Between P-Matrices and Regularity of Interval Matrices, Best $k$-digit rational bounds for irrational numbers: pre- and super-computer era, Pivoting in linear complementarity: Two polynomial-time cases, Discounted Semi-Markov Games and Algorithms for Solving Two Structured Classes, Duality via halfspaces, Hard and Soft Fingered Robot Grippers. The Linear Complementarity Approach, Hadamard Directional Differentiability of the Optimal Value Function of a Quadratic Programming Problem, On equivalent reformulations for absolute value equations, An improvement of the error bounds for linear complementarity problems of Nekrasov matrices, A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps, The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone, A modulus-based nonmonotone line search method for nonlinear complementarity problems, New error bounds for linear complementarity problems of weakly chained diagonally dominant $B$-matrices, Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems, Two-step modulus-based matrix splitting iteration methods for retinex problem, Tensor complementarity problems: the GUS-property and an algorithm, The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices, A new strategy for solving variational inequalities in bounded polytopes^∗, Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems, CKV-type $B$-matrices and error bounds for linear complementarity problems, Convergence of modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems, Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones, Accelerated double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems, Optimality Conditions for Mechanical Impacts, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, The relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems of positive definite matrices, Newton-type methods for solving quasi-complementarity problems via sign-based equation, Unnamed Item, On ``P property and the column-W property, Using vector divisions in solving the linear complementarity problem, A mixed finite element and mesh-free method using linear complementarity theory for gradient plasticity, Finiteness of Criss-Cross Method in Complementarity Problem, Pairwise solutions and the core of transportation situations, Counting unique-sink orientations, The role of representative submatrices in vertical linear complementarity theory, Quitting Games and Linear Complementarity Problems, Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem, An iterative method for solving absolute value equations and sufficient conditions for unique solvability, On generalizations of positive subdefinite matrices and the linear complementarity problem, PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX, Unnamed Item, Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study, Linear complementarity as absolute value equation solution, A sensitivity analysis algorithm for hierarchical decision models, Lexicographic perturbation for multiparametric linear programming with applications to control, An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems, Tolerances, robustness and parametrization of matrix properties related to optimization problems, Neural network approach to firm grip in the presence of small slips, On the finite convergence of Newton-type methods for $P_{0}$ affine variational inequalities, A characterization of upper semi-continuity of the solution map to the horizontal linear complementarity problem of typeR0, A Modulus Iteration Method for SPSD Linear Complementarity Problem Arising in Image Retinex, Exceptional families of elements for set-valued mappings: an application to nonlinear complementarity problems, A gravitational interior point method for LP., Unnamed Item, Fast and efficient linear programming and linear least-squares computations, Extended LQP method for monotone nonlinear complementarity problems, Formulation and preparation for numerical evaluation of linear complementarity systems in dynamics, Modelling electromechanical systems with electrical switching components using the linear complementarity problem, Sufficient matrices belong to $L$., A class of polynomially solvable linear complementarity problems, On the upper semi-continuity of the solution map to the vertical implicit homogeneous complementarity problem of type $R_{0}$, Unnamed Item, A Time-Stepping Algorithm for Stiff Mechanical Systems with Unilateral Constraints, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, A smoothing Levenberg-Marquardt method for NCP, Proximal Distance Algorithms: Theory and Examples, Convergence of a non-interior smoothing method for variational inequality problems, Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an $H_+$-matrix, Design of linear phase FIR filters via linear complementarity problem approach, Models of non-smooth switches in electrical systems, The improved convergence of MSMMAOR method for linear complementarity problems, The relaxation convergence of multisplitting AOR method for linear complementarity problem, A note on the unique solution of linear complementarity problem, Efficient Contact Mode Enumeration in 3D, Estimating the Probability that a Function Observed with Noise Is Convex, Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems, An improved generalized flexibility matrix approach for structural damage detection, Conflict Analysis for MINLP, A Lipschitz Matrix for Parameter Reduction in Computational Science, An alternating direction method of multipliers for the eigenvalue complementarity problem, Sensitivity analysis in linear optimization: invariant support set intervals, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, A FULL MULTIGRID METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS ARISING FROM ELASTIC NORMAL CONTACT PROBLEMS, Deflation for semismooth equations, Unnamed Item, Linear Games and Complementarity Problems, Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones