Pages that link to "Item:Q922951"

The following pages link to Convergence properties of trust region methods for linear and convex constraints (Q922951):

Displaying 33 items.

• A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
• An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
• Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
• A projected gradient trust-region method for solving nonlinear systems with convex constraints (Q655752) (← links)
• Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
• On large scale nonlinear network optimization (Q908858) (← links)
• A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem (Q1032811) (← links)
• A trust region algorithm for parametric curve and surface fitting (Q1815878) (← links)
• A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
• A class of trust region methods for linear inequality constrained optimization and its theory analysis. I: Algorithm and global convergence (Q1906570) (← links)
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
• Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem (Q1937005) (← links)
• A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
• The convergence of subspace trust region methods (Q2389569) (← links)
• An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem (Q2412836) (← links)
• Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
• Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
• A robust trust region method for nonlinear optimization with inequality constraint (Q2496002) (← links)
• Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization (Q3083522) (← links)
• (Q3840623) (← links)
• Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems (Q4678767) (← links)
• A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)
• (Q4842456) (← links)
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization (Q4924105) (← links)
• A trust region method with project step for bound constrained optimization without compact condition (Q5031242) (← links)
• The Conjugate Residual Method in Linesearch and Trust-Region Methods (Q5231696) (← links)
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)
• Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
• Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm (Q6601376) (← links)