Large-scale active-set box-constrained optimization method with spectral projected gradients
From MaRDI portal
Publication:1812088
DOI10.1023/A:1019928808826zbMath1031.90012OpenAlexW1546275378MaRDI QIDQ1812088
Ernesto G. Birgin, José Mario Martínez
Publication date: 18 June 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019928808826
Related Items (75)
A two-stage active-set algorithm for bound-constrained optimization ⋮ On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees ⋮ Optimizing the packing of cylinders into a rectangular container: A nonlinear approach ⋮ An inexact-restoration method for nonlinear bilevel programming problems ⋮ An augmented Lagrangian method exploiting an active-set strategy and second-order information ⋮ The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems ⋮ Packing ellipsoids by nonlinear optimization ⋮ Second-order negative-curvature methods for box-constrained and general constrained optimization ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Finding graph embeddings by incremental low-rank semidefinite programming ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Local convergence of an inexact-restoration method and numerical experiments ⋮ A Shape-Newton Approach to the Problem of Covering with Identical Balls ⋮ Optimal weed population control using nonlinear programming ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ 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 ⋮ An application-based characterization of dynamical distance geometry problems ⋮ On the use of third-order models with fourth-order regularization for unconstrained optimization ⋮ Evaluating bound-constrained minimization software ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ On the minimization of possibly discontinuous functions by means of pointwise approximations ⋮ 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 ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ Total Variation Based Community Detection Using a Nonlinear Optimization Approach ⋮ An active-set projected trust region algorithm for box constrained optimization problems ⋮ Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization ⋮ Handling infeasibility in a large-scale nonlinear optimization algorithm ⋮ Outer trust-region method for constrained optimization ⋮ An active set limited memory BFGS algorithm for bound constrained optimization ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ Global minimization using an augmented Lagrangian method with variable lower-level constraints ⋮ The bound-constrained conjugate gradient method for non-negative matrices ⋮ Scaled projected-directions methods with application to transmission tomography ⋮ 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 ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ 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 ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Augmented Lagrangian methods under the constant positive linear dependence constraint qualification ⋮ Minimizing the object dimensions in circle and sphere packing problems ⋮ Preconditioning for partial differential equation constrained optimization with control constraints ⋮ Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization ⋮ Packing circles within ellipses ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ Residual algorithm for large-scale positive definite generalized eigenvalue problems ⋮ Continuous GRASP with a local active-set method for bound-constrained global optimization ⋮ Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization ⋮ Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints ⋮ An algorithm for the fast solution of symmetric linear complementarity problems ⋮ Quasi-Newton acceleration for equality-constrained minimization ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization ⋮ Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization ⋮ A support tool for planning classrooms considering social distancing between students ⋮ Low order-value optimization and applications ⋮ First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants ⋮ Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves ⋮ Impulse noise removal by an adaptive trust-region method ⋮ A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls ⋮ 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 ⋮ On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization ⋮ Complexity and performance of an Augmented Lagrangian algorithm ⋮ 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 ⋮ A decomposition method for Lasso problems with zero-sum constraint ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems
Uses Software
This page was built for publication: Large-scale active-set box-constrained optimization method with spectral projected gradients
