Algorithm 813
From MaRDI portal
Publication:5461003
DOI10.1145/502800.502803zbMath1070.65547OpenAlexW1978100686WikidataQ113309787 ScholiaQ113309787MaRDI QIDQ5461003
Marcos Raydan, Ernesto G. Birgin, José Mario Martínez
Publication date: 20 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502800.502803
Numerical mathematical programming methods (65K05) Convex programming (90C25) Packaged methods for numerical algorithms (65Y15)
Related Items
Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate., On the application of the spectral projected gradient method in image segmentation, Inexact restoration for derivative-free expensive function minimization and applications, Inexact variable metric method for convex-constrained optimization problems, Optimizing the packing of cylinders into a rectangular container: A nonlinear approach, Hybrid spectral gradient method for the unconstrained minimization problem, 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, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Gradient methods with adaptive step-sizes, Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, A convex optimization approach for solving large scale linear systems, Monotone projected gradient methods for large-scale box-constrained quadratic programming, An extended delayed weighted gradient algorithm for solving strongly convex optimization problems, A nonlinear programming model with implicit variables for packing ellipsoids, An active set trust-region method for bound-constrained optimization, Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Evaluating bound-constrained minimization software, Adjoint-free calculation method for conditional nonlinear optimal perturbations, A Newton's method for the continuous quadratic knapsack problem, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, Positive Definite Matrices: Data Representation and Applications to Computer Vision, Inexact restoration method for minimization problems arising in electronic structure calculations, Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems, An investigation of feasible descent algorithms for estimating the condition number of a matrix, Sensitivity analysis and tailored design of minimization diagrams, A cyclic projected gradient method, A projected-gradient interior-point algorithm for complementarity problems, Modified active set projected spectral gradient method for bound constrained optimization, An active set limited memory BFGS algorithm for bound constrained optimization, Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations, On the natural merit function for solving complementarity problems, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, 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, On a scalable nonparametric denoising of time series signals, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, A computation study on an integrated alternating direction method of multipliers for large scale optimization, An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation, Nonmonotone projected gradient methods based on barrier and Euclidean distances, The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Convex constrained optimization for large-scale generalized Sylvester equations, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, Large correlation analysis, Residual algorithm for large-scale positive definite generalized eigenvalue problems, A new line search inexact restoration approach for nonlinear programming, Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems, A projected derivative-free algorithm for nonlinear equations with convex constraints, 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, Exact spectral-like gradient method for distributed optimization, An algorithm for the fast solution of symmetric linear complementarity problems, Quasi-Newton acceleration for equality-constrained minimization, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations, SPG, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Block relaxation and majorization methods for the nearest correlation matrix with factor structure, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Regularized graph cuts based discrete tomography reconstruction methods, 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 flexible inexact-restoration method for constrained optimization, A non-monotonic method for large-scale non-negative least squares, An efficient implementation of a trust region method for box constrained optimization, CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization, Minimization subproblems and heuristics for an applied clustering problem, Convergence analysis for the modified spectral projected subgradient method
Uses Software
