Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798): Difference between revisions

Revision as of 14:44, 24 May 2024

scientific article; zbMATH DE number 946906

Language	Label	Description	Also known as
English	Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem	scientific article; zbMATH DE number 946906

Statements

instance of

scholarly article

0 references

title

Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (English)

0 references

0 references

0 references

0 references

Statistica Neerlandica

0 references

publication date

1996

0 references

zbMATH Keywords

historical survey

0 references

Karmarkar's polynomial algorithm

0 references

semidefinite optimization

0 references

interior point methods

0 references

describes a project that uses

CPLEX

0 references

LOQO

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/j.1467-9574.1996.tb01485.x

0 references

cites work

An implementation of Karmarkar's algorithm for linear programming

0 references

On Long Step Path Following and SUMT for Linear and Quadratic Programming

0 references

The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories

0 references

A New Method for Optimal Truss Topology Design

0 references

On computing the determinant in small parallel time using a small number of processors

0 references

Linear Matrix Inequalities in System and Control Theory

0 references

Semidefinite Programming

0 references

Computational experience with penalty-barrier methods for nonlinear programming

0 references

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

0 references

Cutting planes and column generation techniques with the projective algorithm

0 references

Q3359644

0 references

On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set

0 references

Path-Following Methods for Linear Programming

0 references

Q4296156

0 references

On the classical logarithmic barrier function method for a class of smooth convex programming problems

0 references

Q3995706

0 references

Approximate graph coloring by semidefinite programming

0 references

A new polynomial-time algorithm for linear programming

0 references

The Cutting-Plane Method for Solving Convex Programs

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Feasibility issues in a primal-dual interior-point method for linear programming

0 references

Computational experience with a primal-dual interior point method for linear programming

0 references

Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art

0 references

An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

Q4324980

0 references

A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming

0 references

Q4849481

0 references

A polynomial-time algorithm, based on Newton's method, for linear programming

0 references

A polynomial method of approximate centers for linear programming

0 references

LOQO:an interior point code for quadratic programming

0 references

Algorithms for Minimum Trace Factor Analysis

0 references

A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

A path following algorithm for a class of convex programming problems

0 references

Identifiers

zbMATH Open document ID

0858.90095

0 references

DOI

10.1111/j.1467-9574.1996.tb01485.x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4715798

@@ Property / cites work @@
+An implementation of Karmarkar's algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On Long Step Path Following and SUMT for Linear and Quadratic Programming
+Normal rank
@@ Property / cites work @@
+The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
+Normal rank
@@ Property / cites work @@
+A New Method for Optimal Truss Topology Design
@@ Property / cites work: A New Method for Optimal Truss Topology Design / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the determinant in small parallel time using a small number of processors
+Normal rank
@@ Property / cites work @@
+Linear Matrix Inequalities in System and Control Theory
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experience with penalty-barrier methods for nonlinear programming
+Normal rank
@@ Property / cites work @@
+On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
+Normal rank
@@ Property / cites work @@
+Cutting planes and column generation techniques with the projective algorithm
+Normal rank
@@ Property / cites work @@
+Q3359644
@@ Property / cites work: Q3359644 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
+Normal rank
@@ Property / cites work @@
+Path-Following Methods for Linear Programming
@@ Property / cites work: Path-Following Methods for Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+On the classical logarithmic barrier function method for a class of smooth convex programming problems
+Normal rank
@@ Property / cites work @@
+Q3995706
@@ Property / cites work: Q3995706 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+The Cutting-Plane Method for Solving Convex Programs
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Feasibility issues in a primal-dual interior-point method for linear programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
+Normal rank
@@ Property / cites work @@
+An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4849481
@@ Property / cites work: Q4849481 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+LOQO:an interior point code for quadratic programming
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Trace Factor Analysis
@@ Property / cites work: Algorithms for Minimum Trace Factor Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+A path following algorithm for a class of convex programming problems
+Normal rank