Structured regularization for barrier NLP solvers
From MaRDI portal
Publication:523568
DOI10.1007/s10589-016-9880-7zbMath1369.90171OpenAlexW2529298871WikidataQ114859265 ScholiaQ114859265MaRDI QIDQ523568
Publication date: 21 April 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9880-7
Related Items
Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming, A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control
Uses Software
Cites Work
- Unnamed Item
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
- Advantages of Nonlinear-Programming-Based Methodologies for Inequality Path-Constrained Optimal Control Problems—A Numerical Study
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
- LOQO:an interior point code for quadratic programming
- Interior Methods for Nonlinear Optimization
- Nonlinear Programming
- A Filter Method with Unified Step Computation for Nonlinear Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- CUTEr and SifDec
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.