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 (only showing first 100 items - show all)

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

This page was built for publication: