scientific article; zbMATH DE number 1017028

zbMATH Open0954.65041MaRDI QIDQ4339096FDOQ4339096

Authors: Kees Roos, Tamás Terlaky, Jean-Philippe Vial

Publication date: 4 June 1997

Title of this publication is not available (Why is that?)

Recommendations

scientific article; zbMATH DE number 5359577
Linear and nonlinear programming.
Linear optimization and extensions
Linear optimization. Model, solution, application.
Pivot versus interior point methods: Pros and cons
scientific article; zbMATH DE number 1168999
Linear optimization
Linear programming and its application.
scientific article; zbMATH DE number 2046035
A mathematical primer on linear optimization

linear programming convergence interior point methods complexity asymptotic behaviour textbook linear optimization Karmarkar's projective method logarithmic barrier approach target following approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (only showing first 100 items - show all)

Spline regression models for complex multi-modal regulatory networks
An efficient logarithmic barrier method without line search for convex quadratic programming
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
A self-adjusting primal–dual interior point method for linear programs
Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
New parameterized kernel functions for linear optimization
Dual-primal algorithm for linear optimization
Two simple proofs for analyticity of the central path in linear programming.
The sagitta method for solving linear programs
Interior-point methods: An old and new approach to nonlinear programming
Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
An adaptive self-regular proximity-based large-update IPM for LO
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
Sensitivity analysis in linear optimization: invariant support set intervals
Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
An interior point method for linear programming based on a class of Kernel functions
Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
Generation of degenerate linear programming problems
An interior-exterior approach for convex quadratic programming
Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
An efficient parameterized logarithmic kernel function for linear optimization
New method for determining search directions for interior-point algorithms in linear optimization
A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
Analytic centers and repelling inequalities
Warm start by Hopfield neural networks for interior point methods
Interior-point methods for optimization
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
EP theorem for dual linear complementarity problems
A new class of theorems of the alternative
A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
A predictor-corrector algorithm with multiple corrections for convex quadratic programming
A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
A polynomial-time algorithm for linear optimization based on a new class of kernel functions
An infeasible full NT-step interior point method for circular optimization
On the enrouting protocol problem under uncertainty
Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
A smoothing heuristic for a bilevel pricing problem
Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
The asymptotic optimal partition and extensions of the nonsubstitution theorem
Examples of ill-behaved central paths in convex optimization
A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
A new class of polynomial primal-dual methods for linear and semidefinite optimization
A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
A study of the dual affine scaling continuous trajectories for linear programming
A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
An efficient twice parameterized trigonometric kernel function for linear optimization
A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
Opacity for linear constraint Markov chains
A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*
An infeasible full-NT step interior point algorithm for CQSCO
Active constraint set invariancy sensitivity analysis in linear optimization
On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
Dual versus primal-dual interior-point methods for linear and conic programming
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
A new class of copulas involved geometric distribution: estimation and applications
Generic Primal-dual Interior Point Methods Based on a New Kernel Function
Pivot versus interior point methods: Pros and cons
A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Interior-point methods
Large-update interior point algorithm for \(P_*\)-linear complementarity problem
Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
A primal‐dual interior-point method for linear optimization based on a new proximity function
Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
Interrupt timed automata: verification and expressiveness
A full-Newton step interior-point algorithm based on modified Newton direction
Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
Hopfield neural networks in large-scale linear optimization problems
Title not available (Why is that?)
Title not available (Why is that?)
A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
Polynomial time second order mehrotra-type predictor--corrector algorithms
Interior Point Methods for Linear Optimization
On an inverse linear programming problem
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339096)