An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
From MaRDI portal
Publication:4389186
DOI10.1137/S1052623493253991zbMath0911.90301MaRDI QIDQ4389186
Francisco Facchinei, Joaquim Joao Júdice, João Oliveira Soares
Publication date: 12 May 1998
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)
Related Items (50)
A trust region method with project step for bound constrained optimization without compact condition ⋮ Some recent advances in projection-type methods for variational inequalities ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ A Phase-Field Approach to Pneumatic Fracture ⋮ An active set quasi-Newton method with projection step for monotone nonlinear equations ⋮ An active set truncated Newton method for large-scale bound constrained optimization ⋮ Projected affine-scaling interior-point Newton's method with line search filter for box 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 ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems ⋮ A recursive multilevel trust region method with application to fully monolithic phase-field models of brittle fracture ⋮ Convex programming with single separable constraint and bounded variables ⋮ Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy ⋮ An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization ⋮ On a box-constrained linear symmetric cone optimization problem ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ An active set strategy based on the multiplier function or the gradient. ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ An active-set projected trust region algorithm for box constrained optimization problems ⋮ Modified active set projected spectral gradient method for bound constrained optimization ⋮ 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 ⋮ A feasible direction method for the semidefinite program with box constraints ⋮ An active set limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ A feasible decomposition method for constrained equations and its application to complementarity problems ⋮ A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization ⋮ Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations ⋮ Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Globally convergent DC trust-region methods ⋮ An accurate active set Newton algorithm for large scale bound constrained optimization. ⋮ Solving equations via the trust region and its application to a class of stochastic linear complementarity problems ⋮ An active set quasi-Newton method with projected search for bound constrained minimization ⋮ Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization ⋮ Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ New constrained optimization reformulation of complementarity problems ⋮ Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization ⋮ A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient ⋮ An active-set algorithmic framework for non-convex optimization problems over the simplex ⋮ AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION ⋮ A note on the solution to a common thermal network problem encountered in heat-transfer analysis of spacecraft ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ A decomposition method for Lasso problems with zero-sum constraint
Uses Software
This page was built for publication: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
