Publication:4039868
From MaRDI portal
zbMath0634.90037MaRDI QIDQ4039868
Publication date: 5 June 1993
computational complexity; Lagrange multipliers; gradient methods; ellipsoid; descent methods; optimality results; linear complementary; Karmarkar algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M29: Numerical methods involving duality
90C20: Quadratic programming
90C05: Linear programming
49M37: Numerical methods based on nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90C52: Methods of reduced gradient type
90C99: Mathematical programming
49-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control
Related Items
Duality via halfspaces, Hard and Soft Fingered Robot Grippers. The Linear Complementarity Approach, The role of representative submatrices in vertical linear complementarity theory, Unnamed Item, The symmetric eigenvalue complementarity problem, A new strategy for solving variational inequalities in bounded polytopes∗, Models of non-smooth switches in electrical systems, A characterization of upper semi-continuity of the solution map to the horizontal linear complementarity problem of typeR0, 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, 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., 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, A Jacobian smoothing method for box constrained variational inequality problems, Steady-state performance evaluation of continuous mono-T-semiflow Petri nets, Principal pivot transforms of some classes of 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, 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, \(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, 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 good submatrix is hard to find, Some NP-complete problems in linear programming, On the equivalence of linear complementarity problems, Some recent advances in projection-type methods for variational inequalities, On semimonotone matrices with nonnegative principal minors, New variants of the criss-cross method for linearly constrained convex quadratic programming, Fuzzy approximation to an infeasible generalized 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\), 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, \(\varepsilon\)-approximation minimization of convex functions in fixed dimension, Metamodelling techniques in multidimensional optimality analysis for linear programming, A direct heuristic algorithm for linear programming, 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, On a class of semimonotone \(Q_ 0\)-matrices in the linear complementarity problem, Pairwise solutions and the core of transportation situations, 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}\), A smoothing Levenberg-Marquardt method for NCP, Sensitivity analysis in linear optimization: invariant support set intervals, Quadratic programming is in NP, Neural network approach to firm grip in the presence of small slips, Fast and efficient linear programming and linear least-squares computations, Design of linear phase FIR filters via linear complementarity problem approach, Unnamed Item, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, 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, Incremental constraint deletion in systems of linear constraints, Constructive characterization of Lipschitzian \(Q_ 0\)-matrices, On a global projection-type error bound for the linear complementarity problem, Issues in computing contact forces for non-penetrating rigid bodies, 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, 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, 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, A smoothing Broyden-like method for the mixed complementarity problems, 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, A simplex algorithm for piecewise-linear fractional programming problems, On computer-assisted proofs for solutions of linear complementarity problems, Breast cancer prediction using the isotonic separation technique, A new \(O(n^ 2)\) shortest chain algorithm, Perturbation results for the linear complementarity problem, Good hidden \(P\)-matrix sandwiches, 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
