Interior point methods 25 years later

From MaRDI portal

Publication:439546

Jump to:navigation, search

DOI10.1016/j.ejor.2011.09.017zbMath1244.90007OpenAlexW2068531154MaRDI QIDQ439546

Jacek Gondzio

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.017

zbMATH Keywords

linear programming quadratic programming matrix-free methods interior point methods implementation worst-case complexity analysis

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Interior-point methods (90C51) History of mathematics in the 20th century (01A60) Development of contemporary mathematics (01A65) History of operations research and mathematical programming (90-03)

Related Items

Large-scale optimization with the primal-dual column generation method, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, Newton projection method as applied to assembly simulation, A new interior-point approach for large separable convex quadratic two-stage stochastic problems, Sparse Approximations with Interior Point Methods, Scenario aggregation method for portfolio expectile optimization, A globally convergent regularized interior point method for constrained optimization, Improved penalty algorithm for mixed integer PDE constrained optimization problems, Local convergence analysis of inexact Newton method with relative residual error tolerance under majorant condition in Riemannian manifolds, Crash start of interior point methods, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Improving the preconditioning of linear systems from interior point methods, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, On the update of constraint preconditioners for regularized KKT systems, Efficient numerical computations of yield stress fluid flows using second-order cone programming, On a Reduction for a Class of Resource Allocation Problems, A new proposal to improve the early iterations in the interior point method, Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems, Solving nested-constraint resource allocation problems with an interior point method, Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization, Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections, Optimized choice of parameters in interior-point methods for linear programming, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, An interior point method for nonlinear optimization with a quasi-tangential subproblem, Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods, Towards an efficient augmented Lagrangian method for convex quadratic programming, Literature reviews in operations research: a new taxonomy and a meta review, On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach, Adaptive inexact smoothing Newton method for a nonconforming discretization of a variational inequality, Preconditioners for Krylov subspace methods: An overview, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Recycling basic columns of the splitting preconditioner in interior point methods, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Matrix Balancing Based Interior Point Methods for Point Set Matching Problems, Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity, A proximal interior point algorithm with applications to image processing, Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization, Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming, Using groups in the splitting preconditioner computation for interior point methods, Calmness of partially perturbed linear systems with an application to the central path, A guide to conic optimisation and its applications, Fast Solution Methods for Convex Quadratic Optimization of Fractional Differential Equations, A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems, A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models, An interior-point trust-funnel algorithm for nonlinear optimization, Improving a primal–dual simplex-type algorithm using interior point methods, Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method, The double pivot simplex method, A variation on the interior point method for linear programming using the continued iteration, Computation of optimal transport with finite volumes, A linear programming approach for designing multilevel PWM waveforms, A specialized primal-dual interior point method for the plastic truss layout optimization, Solving large-scale optimization problems related to Bell's theorem, A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods, Interior-point methods for the phase-field approach to brittle and ductile fracture, A matrix-free smoothing algorithm for large-scale support vector machines, An interior point-proximal method of multipliers for convex quadratic programming, An overview of population-based algorithms for multi-objective optimisation, A mathematical programming model for computing the fries number of a fullerene, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Matrix-free interior point method for compressed sensing problems, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, A Single-Phase, Proximal Path-Following Framework, Projective Cutting-Planes, Design and implementation of a modular interior-point solver for linear optimization, The Wasserstein Distance as a Dissimilarity Measure for Mass Spectra with Application to Spectral Deconvolution, Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme, INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING, Quasi-Newton approaches to interior point methods for quadratic problems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Smoothly adaptively centered ridge estimator, An ADMM-based interior-point method for large-scale linear programming, Block preconditioners for linear systems in interior point methods for convex constrained optimization, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics, Material-separating regularizer for multi-energy x-ray tomography, An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations, On a primal-dual Newton proximal method for convex quadratic programs, Analysis of a nonsmooth optimization approach to robust estimation, Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming, Active-set prediction for interior point methods using controlled perturbations

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:439546&oldid=12316393"