scientific article; zbMATH DE number 192986
From MaRDI portal
Publication:4039868
computational complexitydescent methodsellipsoidgradient methodsKarmarkar algorithmLagrange multiplierslinear complementaryoptimality results
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Quadratic programming (90C20) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of reduced gradient type (90C52) Mathematical programming (90C99)
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Conjugate gradient method for the linear complementarity problem withs-matrix
- Determining maximal efficient faces in multiobjective linear programming problem
- Modeling and algorithm on a class of mechanical systems with unilateral constraints
- Multi-commodity supply network planning in the forest supply chain
- Solving stochastic complementarity problems in energy market modeling using scenario reduction
- Worst case analysis of resistive networks using linear programming approach
- On the complexity of a pivot step of the revised simplex algorithm
- Minimax linear programming problem
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
- On the solution of linear programming problems with free (unrestricted) variables
- The linear complementarity problem and a subclass of fully semimonotone matrices
- Strongly polynomial algorithm for a class of combinatorial LCPs
- A new simple homotopy algorithm for linear programming. I
- Two characterization theorems in complementarity theory
- Computing complex chemical equilibria by generalized linear programming
- The k most vital arcs in the shortest path problem
- 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
- A time minimising transportation problem with quantity dependent time
- The set of limiting distributions for a Markov chain with fuzzy transition probabilities
- On the bottleneck linear programming problem
- A preview of a tolerance approach to sensitivity analysis in linear programming
- 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
- 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
- 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
- Dynamic lot-sizing with setup cost reduction
- The balanced linear programming problem
- On the convergence of the block principal pivotal algorithm for the LCP
- A new technique for inconsistent QP problems in the SQP method
- On local w-uniqueness of solutions to linear complementarity problem
- Convex constrained programmes with unattained infima
- 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
- 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
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- MINOS(IIS): Infeasibility analysis using MINOS
- Criteria for copositive matrices of order four
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- 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
- 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
- On Lipschitzian \(Q_ 0\) and INS matrices
- Evolution of plastic anisotropy for high-strain-rate computations
- FE-formulation of a nonlocal plasticity theory
- On the connectedness of solution sets in linear complementarity problems
- 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
- A set-valued force law for spatial Coulomb--Contensou friction.
- An MM Algorithm for Split Feasibility Problems
- A test for copositive matrices
- Symbiosis between linear algebra and optimization
- 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
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- Multiparametric demand transportation problem
- Hybrid extreme point tabu search
- The modulus-based nonsmooth Newton's method for solving a class of nonlinear complementarity problems of \(P\)-matrices
- 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
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Modulus-based matrix splitting algorithms for the quasi-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
- 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
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
- The sign-based methods for solving a class of nonlinear complementarity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039868)
