scientific article; zbMATH DE number 1862745
From MaRDI portal
Publication:4791754
zbMath1136.90045MaRDI QIDQ4791754
Tamás Terlaky, Cornelis Roos, Jiming Peng
Publication date: 3 February 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, Interior-point methods based on kernel functions for symmetric optimization, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY, An efficient fifth-order method for linear optimization, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood, Infeasible interior-point methods for linear optimization based on large neighborhood, A polynomial interior-point algorithm for monotone linear complementarity problems, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem, The accuracy of interior-point methods based on kernel functions, A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, A full-Newton step interior-point algorithm based on modified Newton direction, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions, An adaptive-step primal-dual interior point algorithm for linear optimization, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, 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, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, Some useful inequalities via trace function method in Euclidean Jordan algebras, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, Full-NT step infeasible interior-point method for SOCO based on a specific kernel function, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, An infeasible interior-point algorithm with full-Newton step for linear optimization, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Hardness-packing density scaling relations for cohesive-frictional porous materials, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, New parameterized kernel functions for linear optimization, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, On self-regular IPMs (with comments and rejoinder), A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, An efficient parameterized logarithmic kernel function for semidefinite optimization, An interior-point algorithm for linear optimization based on a new barrier function, Interior-point algorithm for linear optimization based on a new trigonometric kernel function, An efficient parameterized logarithmic kernel function for linear optimization, New method for determining search directions for interior-point algorithms in linear optimization, The complexity of self-regular proximity based infeasible IPMs, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization, A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions, 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, Self-Regular Interior-Point Methods for Semidefinite Optimization, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, An adaptive infeasible interior-point algorithm for linear complementarity problems, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, A class of large-update and small-update primal-dual interior-point algorithms for linear optimization, A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite 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, A large-update primal–dual interior-point algorithm for second-order cone optimization 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, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, An efficient twice parameterized trigonometric kernel function for linear optimization, Generalized self-concordant functions: a recipe for Newton-type methods, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, A full-step interior-point algorithm for linear complementarity problem based on a simple function, An interior point approach for linear complementarity problem using new parametrized kernel function, Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming, A corrector–predictor path-following algorithm for semidefinite optimization, A new primal-dual interior-point algorithm for convex quadratic optimization, Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, 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, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A polynomial-time algorithm for linear optimization based on a new simple kernel function, Interior Point Methods for Nonlinear Optimization, An interior point method for linear programming based on a class of Kernel functions, Unnamed Item, A SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION, 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, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Kernel-function Based Algorithms for Semidefinite Optimization, A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, On Optimality Conditions for Nonlinear Conic Programming
Uses Software
