scientific article; zbMATH DE number 590363

Publication date: 15 June 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

interior point methods affine scaling path-following methods affine potential reduction methods projective potential reduction methods

Mathematics Subject Classification ID

Convex programming (90C25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure., Primal-dual algorithms for linear programming based on the logarithmic barrier method, A generalized interior-point barrier function approach for smooth convex programming with linear constraints, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Asymptotic analysis of a path-following barrier method for linearly constrained convex problems^*, On controlling the parameter in the logarithmic barrier term for convex programming problems, Potential reduction method for harmonically convex programming, An efficient semi-blind source extraction algorithm and its applications to biomedical signal extraction, Fuzzy goal programming: complementary slackness conditions and computational schemes, Utility function programs and optimization over the efficient set in multiple-objective decision making, A logarithmic barrier approach for linear programming, A logarithmic barrier cutting plane method for convex programming, On the complexity of a combined homotopy interior method for convex programming, Infinite-dimensional quadratic optimization: Interior-point methods and control applications, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Applications of one-shot methods in PDEs constrained shape optimization, A new primal-dual interior-point algorithm for convex quadratic optimization, Inverse barriers and CES-functions in linear programming, Primal-dual target-following algorithms for linear programming, Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space, A logarithmic barrier interior-point method based on majorant functions for second-order cone programming, Applications of second-order cone programming, Long-step path-following algorithm for quantum information theory: some numerical aspects and applications, Robust identification and control based on ellipsoidal parametric uncertainty descriptions, \(L^{p}\)-norms, log-barriers and Cramer transform in optimization, Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, Constraint consensus methods for finding interior feasible points in second-order cones, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, Optimal experimental design and some related control problems, On convex optimization without convex representation, Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A general projection framework for constrained smoothing., Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming, Interior Point Methods for Nonlinear Optimization, A polynomial time algorithm for Zero-Clairvoyant scheduling, Polynomial Interior Point Cutting Plane Methods, Unnamed Item, The use of stochastic analytic center for yield maximization of systems with general distributions of component values, Computing Maximum Likelihood Estimators of Convex Density Functions, Why the logarithmic barrier function in convex and linear programming?, An easy way to teach interior-point methods., Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, A primal‐dual interior-point method for linear optimization based on a new proximity function, Actuator fault diagnosis with robustness to sensor distortion, An interior-point algorithm for linear optimization based on a new barrier function, Riemannian Newton method for positive bounded Hessian functions, Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes, A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming, Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Deriving robust counterparts of nonlinear uncertain inequalities, On well definedness of the central path, Long-step interior-point algorithms for a class of variational inequalities with monotone operators, Proximal methods in view of interior-point strategies, Cost-effective sulphur emission reduction under uncertainty, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, On self-concordant barrier functions for conic hulls and fractional programming, High resolution pursuit for feature extraction, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization, Long-step primal path-following algorithm for monotone variational inequality problems, INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, An interior point method, based on rank-1 updates, for linear programming, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Sparsity in convex quadratic programming with interior point methods, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, A long-step primal-dual path-following method for semidefinite programming, Higher-order derivatives in linear and quadratic programming, High-Dimensional Data Classification