Learning to steer nonlinear interior-point methods
DOI10.1007/S13675-019-00118-4zbMATH Open1437.90148OpenAlexW2969523654WikidataQ127353840 ScholiaQ127353840MaRDI QIDQ2175369FDOQ2175369
Publication date: 29 April 2020
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-019-00118-4
nonlinear programmingconstrained optimizationreinforcement learninginterior-point algorithmdeep Q-learning
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Learning and adaptive systems in artificial intelligence (68T05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Object-oriented software for quadratic programming
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Benchmarking optimization software with performance profiles.
- Planning and acting in partially observable stochastic domains
- \({\mathcal Q}\)-learning
- Finite-time analysis of the multiarmed bandit problem
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Interior Methods for Nonlinear Optimization
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- A nonmonotone filter method for nonlinear optimization
- The ESA NLP Solver WORHP
- An interior-point algorithm for nonconvex nonlinear programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- A penalty-interior-point algorithm for nonlinear constrained optimization
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- A local convergence property of primal-dual methods for nonlinear programming
- On learning and branching: a survey
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Learning when to use a decomposition
Uses Software
This page was built for publication: Learning to steer nonlinear interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175369)
