A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
From MaRDI portal
Publication:4785864
DOI10.1137/S1052623499359890zbMath1035.90103MaRDI QIDQ4785864
Stefano Lucidi, Francisco Facchinei, Laura Palagi
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
A two-stage active-set algorithm for bound-constrained optimization, A convergent decomposition method for box-constrained optimization problems, An active set truncated Newton method for large-scale bound constrained optimization, A decomposition method for large-scale box constrained optimization, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, An active set algorithm for nonlinear optimization with polyhedral constraints, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, An active set feasible method for large-scale minimization problems with bound constraints, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, A novel projected gradient-like method for optimization problems with simple constraints, An active set strategy based on the multiplier function or the gradient., An active-set projected trust region algorithm for box constrained optimization problems, An active set limited memory BFGS algorithm for bound constrained optimization, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, TeLEx: learning signal temporal logic from positive examples using tightness metric, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, An accurate active set Newton algorithm for large scale bound constrained optimization., Sequential systems of linear equations method for general constrained optimization without strict complementarity, An active set quasi-Newton method with projected search for bound constrained minimization, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, An infeasible active-set QP-free algorithm for general nonlinear programming, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization, A trust region method based on a new affine scaling technique for simple bounded optimization
Uses Software
