scientific article
From MaRDI portal
Publication:3491304
zbMath0708.90049MaRDI QIDQ3491304
Shinji Mizuno, Kojima, Masakazu, Akiko Yoshise
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Linear programming (90C05) Duality theory (optimization) (49N15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (only showing first 100 items - show all)
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Determination of optimal vertices from feasible solutions in unimodular linear programming ⋮ Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ Insights into the interior-point methods ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils ⋮ Primal-dual methods for linear programming ⋮ A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term ⋮ Design of computational intelligent procedure for thermal analysis of porous fin model ⋮ Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs ⋮ A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis ⋮ Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems ⋮ What Tropical Geometry Tells Us about the Complexity of Linear Programming ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ 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 ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ A generic kernel function for interior point methods ⋮ Interior-point algorithm based on general kernel function for monotone linear complementarity problem ⋮ A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems ⋮ Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics ⋮ The aggregate constraint homotopy method for nonconvex nonlinear programming ⋮ Search directions for a class of projective methods ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem ⋮ Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function ⋮ Local behavior of the Newton method on two equivalent systems from linear programming ⋮ An extension for identifying search directions for interior-point methods in linear optimization ⋮ A wide neighborhood interior-point algorithm based on the trigonometric kernel function ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity 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 ⋮ A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones ⋮ A primal-dual predictor-corrector interior point method for non-smooth contact dynamics ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ Introduction to duality in optimization theory ⋮ On the convergence analysis of arc search interior point methods for LCPs ⋮ An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming ⋮ 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 ⋮ Rank-one techniques in log-barrier function methods for linear programming ⋮ Global convergence in infeasible-interior-point algorithms ⋮ Interior-point algorithms for semi-infinite programming ⋮ Superlinear convergence of infeasible-interior-point methods for linear programming ⋮ Primal-dual algorithms for linear programming based on the logarithmic barrier method ⋮ Constant potential primal-dual algorithms: A framework ⋮ Polynomiality of infeasible-interior-point algorithms for linear programming ⋮ A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood ⋮ A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming ⋮ A combined homotopy interior point method for general nonlinear programming problems ⋮ Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach ⋮ Fast convergence of the simplified largest step path following algorithm ⋮ Improved complexity using higher-order correctors for primal-dual Dikin affine scaling ⋮ A QMR-based interior-point algorithm for solving linear programs ⋮ 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 ⋮ Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization ⋮ On the complexity of a combined homotopy interior method for convex programming ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ A combined homotopy interior point method for convex nonlinear programming ⋮ The implementation of linear programming algorithms based on homotopies ⋮ New trajectory-following polynomial-time algorithm for linear programming problems ⋮ A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems ⋮ An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points ⋮ Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs ⋮ An infeasible-interior-point algorithm using projections onto a convex set ⋮ Primal-dual target-following algorithms for linear programming ⋮ A lower bound on the number of iterations of long-step primal-dual linear programming algorithms ⋮ A path-following version of the Todd-Burrell procedure for linear programming ⋮ An extension of predictor-corrector algorithm to a class of convex separable program ⋮ On the formulation and theory of the Newton interior-point method for nonlinear programming ⋮ A new continuation method for complementarity problems with uniform P- functions ⋮ Interior path following primal-dual algorithms. I: Linear programming ⋮ A polynomial-time algorithm for a class of linear complementarity problems ⋮ An adaptation of the dual-affine interior point method for the surface flatness problem ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ 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 infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ An adaptive-step primal-dual interior point algorithm for linear optimization ⋮ Regularization techniques in interior point methods ⋮ The \(Q\) method for symmetric cone programming ⋮ Interior point methods 25 years later ⋮ Cubically convergent method for locating a nearby vertex in linear programming ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
This page was built for publication:
