Interior-point methods
From MaRDI portal
Publication:1593831
algorithmscomplexityconvex programmingconvex quadratic programminginterior-point methodslinear programmingmonotone linear complementaritysemi-definite programming
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Quadratic programming (90C20) Semidefinite programming (90C22) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Recommendations
- scientific article; zbMATH DE number 1064582
- Interior-point methods for optimization
- Interior point methods of mathematical programming
- scientific article; zbMATH DE number 1069182
- scientific article; zbMATH DE number 1889340
- Interior Point Methods for Nonlinear Optimization
- Interior-point methods for convex programming
- scientific article; zbMATH DE number 1047685
Cites work
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Average performance of a self-dual interior point algorithm for linear programming
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Multiple centrality corrections in a primal-dual method for linear programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Implementation of a Primal-Dual Interior Point Method
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Superlinear convergence of interior-point algorithms for semidefinite programming
Cited in
(99)- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Performance bounds for linear stochastic control
- Interior point methods of mathematical programming
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- The Kantorovich theorem and interior point methods
- An interior linearization method
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
- Interior point methods for equilibrium problems
- Stochastic task networks -- trading performance for stability
- Dynamic temporal decoupling
- An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
- A lower bound for the area of plateau foams
- Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Accelerating opponent strategy inference for voting dynamics on complex networks
- Robust parameter design and optimization for quality engineering
- Koopman operator method for solution of generalized aggregate data inverse problems
- Provable randomized rounding for minimum-similarity diversification
- Generically globally rigid graphs have generic universally rigid frameworks
- Distance geometry and data science
- A family of symmetric, optimized quadrature rules for pentatopes
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- A primal-dual predictor-corrector interior point method for non-smooth contact dynamics
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Spectral radius minimization for optimal average consensus and output feedback stabilization
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- Cooperative payload transportation with real-time formation control of multi-quadrotors in the presence of uncertainty
- Interior-point algorithms: creation history, research results, applications, and prospects
- Control parameterization approach to time-delay optimal control problems: a survey
- Recent developments in interior-point methods
- A selective strategy for shakedown analysis of engineering structures
- Interior-point methods for linear programming: a review
- A method for weighted projections to the positive definite cone
- Interior Point Methods for Nonlinear Optimization
- Shakedown analysis with multidimensional loading spaces
- scientific article; zbMATH DE number 1047674 (Why is no real title available?)
- scientific article; zbMATH DE number 1047684 (Why is no real title available?)
- scientific article; zbMATH DE number 1047685 (Why is no real title available?)
- scientific article; zbMATH DE number 1069182 (Why is no real title available?)
- scientific article; zbMATH DE number 1145351 (Why is no real title available?)
- Interior point methods 25 years later
- scientific article; zbMATH DE number 1506371 (Why is no real title available?)
- scientific article; zbMATH DE number 1547710 (Why is no real title available?)
- scientific article; zbMATH DE number 1746424 (Why is no real title available?)
- Calmness of partially perturbed linear systems with an application to the central path
- Interior Methods for Nonlinear Optimization
- scientific article; zbMATH DE number 1889340 (Why is no real title available?)
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- Time-varying output-based Takagi-Sugeno fuzzy controller of uncertain nonlinear systems
- A new interior-point approach for large separable convex quadratic two-stage stochastic problems
- scientific article; zbMATH DE number 7625190 (Why is no real title available?)
- An unsupervised stereo matching cost based on sparse representation
- Random projections for linear programming
- Approximate dynamic programming via iterated Bellman inequalities
- Minimum-time speed optimisation over a fixed path
- A quantum interior-point predictor–corrector algorithm for linear programming
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- Formulation for wave propagation in dissipative media and its application to absorbing layers in elastoplastic analysis using mathematical programming
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- Explicit explore, exploit, or escape \((E^4)\): near-optimal safety-constrained reinforcement learning in polynomial time
- scientific article; zbMATH DE number 7705687 (Why is no real title available?)
- The Frank-Wolfe algorithm: a short introduction
- Nonparametric density estimation with nonuniform B-spline bases
- Computing realistic terrains from imprecise elevations
- Lattice enumeration via linear programming
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- An O( nL) iteration primal-dual second-order corrector algorithm for linear programming
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- Short proofs of ideal membership
- Solving variational inequalities and cone complementarity problems in nonsmooth dynamics using the alternating direction method of multipliers
- Gradient preserving operator inference: data-driven reduced-order models for equations with gradient structure
- Semi-definite programming and quantum information
- Functional linear quantile regression on a two-dimensional domain
- On second-order cone functions
- A quadratically convergent sequential programming method for second-order cone programs capable of warm starts
- Numerical lower bound shakedown analysis of engineering structures
- Inexact log-domain interior-point methods for quadratic programming
- Distributed model predictive consensus control for linear multiagent system with coupled state constraints
- On the relationship of interior-point methods
- Hybrid optimization for efficient pruning of randomly generated neural networks
- A neural network based on novel equivalent model for linear complementarity problems
- Hybrid method for linear programming
- Pruning the ensemble of convolutional neural networks using second-order cone programming
- Clustering Sequence Data with Mixture Markov Chains with Covariates Using Multiple Simplex Constrained Optimization Routine (MSiCOR)
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- A novel improved edge-based smoothed particle finite element method for elastoplastic contact analysis using second order cone programming
- RedEx: beyond fixed representation methods via convex optimization
- Variational inequality problem with hyperbolic scalars
- A massively parallel interior-point method for arrowhead linear programs with local linking structure
- Stochastic interior-point methods for smooth conic optimization with applications
- Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
- A fast algorithm for non-negativity model selection
- Primal-dual nonlinear rescaling method for convex optimization
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming
- A non-interior-point smoothing method for variational inequality problem
This page was built for publication: Interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593831)
