Results 281 to 290 of about 1,785,875 (332)
Some of the next articles are maybe not open access.
Journal of Optimization Theory and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Primal-Dual Interior-Point Methods for Domain-Driven Formulations
Mathematics of Operations Research, 2018We study infeasible-start primal-dual interior-point methods for convex optimization problems given in a typically natural form we denote as Domain-Driven formulation.
M. Karimi, L. Tunçel
semanticscholar +1 more source
Barrier Functions in Interior Point Methods
Mathematics of Operations Research, 1996We show that the universal barrier function of a convex cone introduced by Nesterov and Nemirovskii is the logarithm of the characteristic function of the cone. This interpretation demonstrates the invariance of the universal barrier under the automorphism group of the underlying cone.
openaire +2 more sources
2013
The ellipsoid method has an undeniable historical relevance (due to its role in establishing polynomial time for linear programming with integer data). In addition, its underlying idea is simple and elegant. Unfortunately, it is not efficient in practice compared with both the simplex method and the more recent interior-point methods.
Peter Bürgisser, Felipe Cucker
openaire +2 more sources
The ellipsoid method has an undeniable historical relevance (due to its role in establishing polynomial time for linear programming with integer data). In addition, its underlying idea is simple and elegant. Unfortunately, it is not efficient in practice compared with both the simplex method and the more recent interior-point methods.
Peter Bürgisser, Felipe Cucker
openaire +2 more sources
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
Mathematical programming, 2017We analyze sequences generated by interior point methods (IPMs) in convex and nonconvex settings. We prove that moving the primal feasibility at the same rate as the barrier parameter μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage ...
G. Haeser, Oliver Hinder, Y. Ye
semanticscholar +1 more source
The Kantorovich Theorem and interior point methods
Mathematical Programming, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Accelerating Condensed Interior-Point Methods on SIMD/GPU Architectures
Journal of Optimization Theory and Applications, 2023François Pacaud +4 more
semanticscholar +1 more source
Ragnar Frisch and interior-point methods
Optimization Letters, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olav Bjerkholt, Sjur Didrik Flåm
openaire +2 more sources
The interior-point method for linear programming
IEEE Software, 1992A robust, reliable, and efficient implementation of the primal-dual interior-point method for linear programs, which is based on three well-established optimization algorithms, is presented. The authors discuss the theoretical foundation for interior-point methods which consists of three crucial building blocks: Newton's method for solving nonlinear ...
Greg Astfalk +3 more
openaire +1 more source
2013
As was known, the simplex method moves on the underlying polyhedron, from vertex to adjacent vertex along descent edges, until an optimal vertex is reached, or unboundedness of the problem is detected. Nevertheless, it would go through an exponential number of vertices of the polyhedron (Sect. 3.8), and even stall at a vertex forever because of cycling
openaire +1 more source
As was known, the simplex method moves on the underlying polyhedron, from vertex to adjacent vertex along descent edges, until an optimal vertex is reached, or unboundedness of the problem is detected. Nevertheless, it would go through an exponential number of vertices of the polyhedron (Sect. 3.8), and even stall at a vertex forever because of cycling
openaire +1 more source