Trust-region interior-point method for large sparsel1optimization

DOI10.1080/10556780601114204zbMath1193.90197OpenAlexW2094162024MaRDI QIDQ5437524

Jan Vlček, Ladislav Lukšan, Ctirad Matonoha

Publication date: 21 January 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780601114204

zbMATH Keywords

unconstrained optimizationlarge-scale optimizationcomputational experimentsnon-smooth optimizationmodified Newton methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Interior-point methods (90C51)

Related Items (3)

Unnamed Item ⋮ A partitioned PSB method for partially separable unconstrained optimization problems ⋮ ℓ ₁ -Based Construction of Polycube Maps from Complex Shapes

Uses Software

• SNOPT
• ve08
• GQTPAR

Cites Work

• Unnamed Item
• An interior-point algorithm for nonconvex nonlinear programming
• Nonlinear programming and nonsmooth optimization by successive linear programming
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Computing a Trust Region Step
• Interior‐point method for non‐linear non‐convex optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• On the global convergence of trust region algorithms for unconstrained minimization
• Estimation of sparse hessian matrices and graph coloring problems
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• Newton-type methods for unconstrained and linearly constrained optimization
• Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
• Trust Region Methods
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

This page was built for publication: Trust-region interior-point method for large sparsel₁optimization