scientific article; zbMATH DE number 4126998
From MaRDI portal
zbMath0687.90056MaRDI QIDQ4206561
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A globally convergent primal-dual interior point algorithm for convex programming, An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Global convergence in infeasible-interior-point algorithms, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, Limiting behavior of weighted central paths in linear programming, Polynomiality of infeasible-interior-point algorithms for linear programming, Asymptotic analysis of the exponential penalty trajectory in linear programming, Recovering an optimal LP basis from an interior point solution, Scaling, shifting and weighting in interior-point methods, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, On a special class of regularized central paths for semidefinite programs, A primal-dual interior point method whose running time depends only on the constraint matrix, A combined homotopy interior point method for general nonlinear programming problems, Status determination by interior-point methods for convex optimization problems in domain-driven form, Fast convergence of the simplified largest step path following algorithm, A QMR-based interior-point algorithm for solving linear programs, A logarithmic barrier cutting plane method for convex programming, A generalized homogeneous and self-dual algorithm for linear programming, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, The largest step path following algorithm for monotone linear complementarity problems, On the complexity of a combined homotopy interior method for convex programming, Trajectory-following methods for large-scale degenerate convex quadratic programming, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Polynomial time second order mehrotra-type predictor--corrector algorithms, A combined homotopy interior point method for convex nonlinear programming, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-interior-point algorithm using projections onto a convex set, Deriving potential functions via a symmetry principle for nonlinear equations, On the formulation and theory of the Newton interior-point method for nonlinear programming, A polynomial arc-search interior-point algorithm for linear programming, HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Primal-dual methods for linear programming, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, Solving a class of LP problems with a primal-dual logarithmic barrier method, Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, A full-Newton step interior-point algorithm based on modified Newton direction, A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps, An adaptive-step primal-dual interior point algorithm for linear optimization, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A corrector-predictor interior-point method with new search direction for linear optimization, The \(Q\) method for symmetric cone programming, Interior point methods 25 years later, Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings., A noninterior path following algorithm for solving a class of multiobjective programming problems, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, A unified approach to interior point algorithms for linear complementarity problems: A summary, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, Ragnar Frisch and interior-point methods, A path to the Arrow-Debreu competitive market equilibrium, Solving combinatorial optimization problems using Karmarkar's algorithm, A generic kernel function for interior point methods, The double pivot simplex method, Convergence behavior of interior-point algorithms, The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems, Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, An adaptive updating full-Newton step interior-point algorithm with modified Newton direction, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Interior-point algorithm for linear optimization based on a new trigonometric kernel function, An efficient parameterized logarithmic kernel function for linear optimization, A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions, Note on implementing the new sphere method for LP using matrix inversions sparingly, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, A globally convergent interior point algorithm for non-convex nonlinear programming, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, A redundant Klee-Minty construction with all the redundant constraints touching the feasible region, Near boundary behavior of primal-dual potential reduction algorithms for linear programming, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term, An interior point potential reduction method for constrained equations, Multiple centrality corrections in a primal-dual method for linear programming, Advances in the simulation of viscoplastic fluid flows using interior-point methods, Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme, A sublinear parallel algorithm for stable matching, An efficient twice parameterized trigonometric kernel function for linear optimization, On weighted centers for semidefinite programming, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Interior-point methods, The relation between the path of centers and Smale's regularization of the linear programming problem, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A primal-dual infeasible-interior-point algorithm for linear programming, Differential-algebraic approach to linear programming, Computational experience with a primal-dual interior point method for linear programming, A quadratically convergent method for linear programming, An interior point parameterized central path following algorithm for linearly constrained convex programming, On the big \({\mathcal M}\) in the affine scaling algorithm, A primal-dual affine-scaling potential-reduction algorithm for linear programming, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm, A CONSTRUCTIVE PROOF OF THE EXISTENCE OF THE PERIODIC SOLUTION OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS VIA A NON-INTERIOR POINT ENTROPY CONTINUATION METHOD, A NEW CONTINUATION METHOD FOR THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, Calmness of partially perturbed linear systems with an application to the central path, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, The Convergent Generalized Central Paths for Linearly Constrained Convex Programming, Numerical methods of nonlinear optimal control based on mathematical programming, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, Interior Point Methods for Nonlinear Optimization, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, An easy way to teach interior-point methods., Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, Unnamed Item, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, An extension for identifying search directions for interior-point methods in linear optimization, A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, The theory of linear programming:skew symmetric self-dual problems and the central path*
