scientific article; zbMATH DE number 194636
From MaRDI portal
Publication:4692623
zbMath0669.00026MaRDI QIDQ4692623
No author found.
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (31)
A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process ⋮ A Polynomial Method of Weighted Centers for Convex Quadratic Programming ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ An interior point approach for linear complementarity problem using new parametrized kernel function ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ Fusion methods for multiple sensor systems with unknown error densities ⋮ Solving H-horizon, stationary Markov decision problems in time proportional to log (H) ⋮ The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points ⋮ Perturbing the dual feasible region for solving convex quadratic programs ⋮ A relaxed primal-dual path-following algorithm for linear programming ⋮ Insights into the interior-point methods ⋮ Interior-point methods for nonlinear complementarity problems ⋮ A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods ⋮ Silving Linear Programs With Inequality Constraints Via Perturbation of Feasible Region ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ An interior point method for linear programming based on a class of Kernel functions ⋮ An interior multiobjective linear programming algorithm ⋮ Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points ⋮ An interior point algorithm for global optimal solutions and KKT points ⋮ The sagitta method for solving linear programs ⋮ Enhancing the behavior of interior-point methods via identification of variables ⋮ Improved complexity results on solving real-number linear feasibility problems ⋮ A primal‐dual interior-point method for linear optimization based on a new proximity function ⋮ A dynamic large-update primal‐dual interior-point method for linear optimization ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ A SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION ⋮ Interior-point methods for optimization ⋮ Monotone variable-metric algorithm for linearly constrained nonlinear programming ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization ⋮ Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
This page was built for publication:
