scientific article; zbMATH DE number 964349
From MaRDI portal
Publication:5691079
complexity theorydetecting infeasibilityfinite terminationlinear programmingpath-following algorithmspotential-reduction methodsprimal dual interior-point methodssoftware packagessuperlinear convergencetextbook
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)
Cited in
(only showing first 100 items - show all)- Note on implementing the new sphere method for LP using matrix inversions sparingly
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- Warmstarting for interior point methods applied to the long-term power planning problem
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Recovering a probabilistic knowledge structure by constraining its parameter space
- Performance bounds for linear stochastic control
- Numerical simulation of contact problems in vane machinery by a parametric quadratic programming method
- Partitioning multiple objective optimal solutions with applications in radiotherapy design
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Primal central paths and Riemannian distances for convex sets
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Further development of multiple centrality correctors for interior point methods
- A Newton-like method for nonlinear system of equations
- SICOpt: Solution approach for nonlinear integer stochastic programming problems
- Applications of second-order cone programming
- Condition measures and properties of the central trajectory of a linear program
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Dynamic programming method for constrained discrete-time optimal control
- Steplengths in interior-point algorithms of quadratic programming
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- Long-step strategies in interior-point primal-dual methods
- Criss-cross methods: A fresh view on pivot algorithms
- On the minimum norm solution of linear programs
- An optimization approach to multiple sequence alignment
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Piecewise linear methods for nonlinear equations and optimization
- Interior-point methods
- A new algorithm for geometric programming based on the linear structure of its dual problem.
- A theory of complexity for continuous time systems
- Parallel interior-point method for linear and quadratic programs with special structure
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Fractional multi-commodity flow problem: duality and optimality conditions
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A two-resource allocation algorithm with an application to large-scale zero-sum defensive games
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- An approximation method for computing the expected value of max-affine expressions
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Generalized Kalman smoothing: modeling and algorithms
- A framework for multivariable algebraic loops in linear anti-windup implementations
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- Stability and accuracy of inexact interior point methods for convex quadratic programming
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- Lexicographic extension of the reference point method applied in radiation therapy treatment planning
- A multi-objective interpretation of optimal transport
- A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Some developments in the theory of shape constrained inference
- Variants of the Uzawa method for three-order block saddle point problem
- Thermal analysis of longitudinal fin with temperature-dependent properties and internal heat generation by a novel intelligent computational approach using optimized Chebyshev polynomials
- A specialized primal-dual interior point method for the plastic truss layout optimization
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- Interior point methods in DEA to determine non-zero multiplier weights
- A primal-dual regularized interior-point method for convex quadratic programs
- The asymptotic optimal partition and extensions of the nonsubstitution theorem
- A starting point strategy for nonlinear interior methods.
- The Kantorovich theorem and interior point methods
- On self-regular IPMs (with comments and rejoinder)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Examples of ill-behaved central paths in convex optimization
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- Compressive sensing in signal processing: algorithms and transform domain formulations
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Analytic centers and repelling inequalities
- A canonical process for estimation of convex functions: the ``invelope of integrated Brownian motion \(+t^ 4\).
- Piecewise-affine Lyapunov functions for discrete-time linear systems with saturating controls
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- Primal-dual Newton-type interior-point method for topology optimization
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization
- A level set approach for the solution of a state-constrained optimal control problem
- Linear mixed models and penalized least squares
- The convergence of an interior-point method using modified search directions in final iterations
- Non-interior smoothing algorithm for frictional contact problems
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Vehicle sliding mode control with adaptive upper bounds: static versus dynamic allocation to saturated tire forces
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- Learning to classify with missing and corrupted features
- Application of interior-point methods to model predictive control
- On the Newton interior-point method for nonlinear programming problems
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Efficient methods for solving the Stokes problem with slip boundary conditions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691079)
