Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts - MaRDI portal

Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts	scientific article

Statements

scholarly article

0 references

Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-1-4614-0769-0_17

0 references

Alexander Engau

0 references

International Series in Operations Research & Management Science

0 references

publication date

26 April 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-0769-0_17

0 references

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

0 references

On the exact solution of a facility layout problem

0 references

An Exact Approach to the One-Dimensional Facility Layout Problem

0 references

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization

0 references

Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes

0 references

Provably near-optimal solutions for very large single-row facility layout problems

0 references

Experiments in quadratic 0-1 programming

0 references

An Analytic Center Cutting Plane Approach for Conic Programming

0 references

Deux problèmes d'affectation non linéaires

0 references

An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming

0 references

Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

0 references

0 references

The cut polytope and the Boolean quadric polytope

0 references

Geometry of cuts and metrics

0 references

A Study of Indicators for Identifying Zero Variables in Interior-Point Methods

0 references

The integration of an interior-point cutting plane method within a branch-and-price algorithm

0 references

On Interior-Point Warmstarts for Linear and Combinatorial Optimization

0 references

On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

0 references

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

0 references

On constrained optimization by adjoint based quasi-Newton methods

0 references

Warm start of the primal-dual method applied in the cutting-plane scheme

0 references

Reoptimization With the Primal-Dual Interior Point Method

0 references

A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis

0 references

Some Network Flow Problems Solved with Pseudo-Boolean Programming

0 references

0 references

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

Efficient models for the facility layout problem

0 references

Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension

0 references

A new polynomial-time algorithm for linear programming

0 references

0 references

A conversion of an SDP having free variables into the standard form SDP

0 references

A unifying framework for several cutting plane methods for semidefinite programming

0 references

0 references

On Solving A One-Dimensional Space Allocation Problem With Integer Programming

0 references

On free variables in interior point methods

0 references

Computational Experience with an Interior Point Cutting Plane Algorithm

0 references

Polynomial Interior Point Cutting Plane Methods

0 references

Solving real-world linear ordering problems using a primal-dual interior point cutting plane method

0 references

0 references

Solving combinatorial optimization problems using Karmarkar's algorithm

0 references

First- and second-order methods for semidefinite programming

0 references

0 references

0 references

Interior-point methods for optimization

0 references

The Analytic Center Cutting Plane Method with Semidefinite Cuts

0 references

An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities

0 references

A second-order cone cutting surface method: Complexity and application

0 references

Cone-LP's and semidefinite programs: Geometry and a simplex-type method

0 references

Modified barrier functions (theory and methods)

0 references

Lagrange Multipliers and Optimality

0 references

One-Dimensional Space Allocation: An Ordering Algorithm

0 references

An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

0 references

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

The interior-point revolution in optimization: History, recent developments, and lasting consequences

0 references

Warm-Start Strategies in Interior-Point Methods for Linear Programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2802535

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2802535&oldid=36245007"