Pages that link to "Item:Q4389186"

The following pages link to An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints (Q4389186):

Displaying 50 items.

• An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
• An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
• A feasible decomposition method for constrained equations and its application to complementarity problems (Q475708) (← links)
• An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
• Solving equations via the trust region and its application to a class of stochastic linear complementarity problems (Q552359) (← links)
• An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
• A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
• Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
• An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
• A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
• Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations (Q668640) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
• Convex programming with single separable constraint and bounded variables (Q885824) (← links)
• An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
• Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
• An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
• New constrained optimization reformulation of complementarity problems (Q1264991) (← links)
• A note on the solution to a common thermal network problem encountered in heat-transfer analysis of spacecraft (Q1592326) (← links)
• Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization (Q1644087) (← links)
• A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
• Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems (Q1665639) (← links)
• Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
• Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
• Large-scale active-set box-constrained optimization method with spectral projected gradients (Q1812088) (← links)
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
• Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
• An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
• Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
• A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
• Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
• A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
• An active set quasi-Newton method with projection step for monotone nonlinear equations (Q2144849) (← links)
• A recursive multilevel trust region method with application to fully monolithic phase-field models of brittle fracture (Q2175275) (← links)
• A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
• Globally convergent DC trust-region methods (Q2250078) (← links)
• A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
• On a box-constrained linear symmetric cone optimization problem (Q2420823) (← links)
• An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
• An active set-type Newton method for constrained nonlinear systems (Q2760103) (← links)
• An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization (Q2846484) (← links)
• A trust region method based on a new affine scaling technique for simple bounded optimization (Q2867413) (← links)
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization (Q3083522) (← links)
• A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
• A trust region method with project step for bound constrained optimization without compact condition (Q5031242) (← links)