Pages that link to "Item:Q3440221"

The following pages link to A New Active Set Algorithm for Box Constrained Optimization (Q3440221):

Displaying 50 items.

• A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
• Non-negative moment fitting quadrature rules for fictitious domain methods (Q2234890) (← links)
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
• Globally convergent DC trust-region methods (Q2250078) (← links)
• Bio-inspired computing platform for reliable solution of Bratu-type equations arising in the modeling of electrically conducting solids (Q2291005) (← links)
• Optimization of dynamic mechanical response of a composite plate using multi-field coupling with thermal constraints (Q2295308) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
• Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
• Optimal weed population control using nonlinear programming (Q2398149) (← links)
• An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
• PAL-Hom method for QP and an application to LP (Q2419548) (← links)
• A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
• An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
• A parallel algorithm for the concurrent atomistic-continuum methodology (Q2671340) (← links)
• Projection onto a polyhedron that exploits sparsity (Q2817841) (← links)
• Globally convergent primal-dual active-set methods with inexact subproblem solves (Q2832889) (← 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)
• A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
• Computational experience with numerical methods for nonnegative least-squares problems. (Q2889392) (← links)
• On the convergence of an active-set method for ℓ₁minimization (Q2905351) (← links)
• Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization (Q3083522) (← links)
• (Q3404723) (← links)
• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
• New algorithms for maximization of concave functions with box constraints (Q4021561) (← links)
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints (Q4389186) (← links)
• (Q4575032) (← links)
• FaRSA for ℓ₁-regularized convex optimization: local convergence and numerical experience (Q4638928) (← links)
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
• A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
• Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs (Q5005870) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach (Q5113808) (← links)
• Active Set Complexity of the Away-Step Frank--Wolfe Algorithm (Q5124005) (← links)
• Gradient methods exploiting spectral properties (Q5135250) (← links)
• PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization (Q5161766) (← links)
• A hybrid algorithm for solving minimization problem over (<i>R,S</i>)-symmetric matrices with the matrix inequality constraint (Q5175379) (← links)
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
• First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
• On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence (Q5235484) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem (Q5741070) (← links)
• Complexity and performance of an Augmented Lagrangian algorithm (Q5858985) (← links)
• On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)