Large-scale active-set box-constrained optimization method with spectral projected gradients
From MaRDI portal
Recommendations
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Recent advances in bound constrained optimization
- A survey on the active set methods for box constrained optimization
- An active-set projected trust region algorithm for box constrained optimization problems
- A New Active Set Algorithm for Box Constrained Optimization
Cited in
(92)- Quasi-Newton acceleration for equality-constrained minimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Low order-value optimization and applications
- A decomposition method for large-scale box constrained optimization
- On the minimization of possibly discontinuous functions by means of pointwise approximations
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Evaluating bound-constrained minimization software
- An active set feasible method for large-scale minimization problems with bound constraints
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- A support tool for planning classrooms considering social distancing between students
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- A decomposition method for Lasso problems with zero-sum constraint
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- LMBOPT: a limited memory method for bound-constrained optimization
- An application-based characterization of dynamical distance geometry problems
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- A novel projected gradient-like method for optimization problems with simple constraints
- Scaled projected-directions methods with application to transmission tomography
- Optimality properties of an augmented Lagrangian method on infeasible problems
- A two-stage active-set algorithm for bound-constrained optimization
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Optimal weed population control using nonlinear programming
- A nonlinear programming model with implicit variables for packing ellipsoids
- On a box-constrained linear symmetric cone optimization problem
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Minimizing the object dimensions in circle and sphere packing problems
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A non-monotonic method for large-scale non-negative least squares
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Recent advances in bound constrained optimization
- Packing ellipsoids by nonlinear optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Finding graph embeddings by incremental low-rank semidefinite programming
- Improving ultimate convergence of an augmented Lagrangian method
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Inexact spectral projected gradient methods on convex sets
- The bound-constrained conjugate gradient method for non-negative matrices
- On regularization and active-set methods with complexity for constrained optimization
- Convergence properties of a second order augmented Lagrangian method for mathematical programs with complementarity constraints
- Preconditioning for partial differential equation constrained optimization with control constraints.
- Packing circles within ellipses
- A survey on the active set methods for box constrained optimization
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls
- A shape-Newton approach to the problem of covering with identical balls
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- Total variation based community detection using a nonlinear optimization approach
- Active set complexity of the away-step Frank-Wolfe algorithm
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Complexity and performance of an augmented Lagrangian algorithm
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- A multivariate spectral projected gradient method for bound constrained optimization
- Outer trust-region method for constrained optimization
- Modified active set projected spectral gradient method for bound constrained optimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- Quadratic program on a structured nonconvex set
- A feasible direction method for the semidefinite program with box constraints
- Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- An active set method for bound-constrained optimization
- Constrained randomized Gauss-Seidel methods for nonnegative least-squares problem
- Enhancing sharp augmented Lagrangian methods with smoothing techniques for nonlinear programming
- On the global convergence of a general class of augmented Lagrangian methods
- Continuous GRASP with a local active-set method for bound-constrained global optimization
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Impulse noise removal by an adaptive trust-region method
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- An inexact-restoration method for nonlinear bilevel programming problems
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Local convergence of an inexact-restoration method and numerical experiments
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active-set projected trust region algorithm for box constrained optimization problems
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
- An algorithm for the fast solution of symmetric linear complementarity problems
This page was built for publication: Large-scale active-set box-constrained optimization method with spectral projected gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812088)
