Algorithm 813
From MaRDI portal
Recommendations
- Concave programming for finding sparse solutions to problems with convex constraints
- Algorithms for sparsity-constrained optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Sparse convex optimization toolkit: a mixed-integer framework
- A conjugate gradient algorithm for sparse linear inequalities
- An algorithm for constrained convex optimization
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Algorithm 875
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
Cited in
(92)- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Sensitivity analysis and tailored design of minimization diagrams
- On the global convergence of a general class of augmented Lagrangian methods
- 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
- Stress-constrained topology optimization with the augmented Lagrangian method: a comparative study of subproblem solvers
- Accelerated derivative-free spectral residual method for nonlinear systems of equations
- Convex constrained optimization for large-scale generalized Sylvester equations
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- On the application of the spectral projected gradient method in image segmentation
- Hybrid spectral gradient method for the unconstrained minimization problem
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Large correlation analysis
- A cyclic projected gradient method
- A non-monotonic method for large-scale non-negative least squares
- Continuous GRASP with a local active-set method for bound-constrained global optimization
- Quasi-Newton acceleration for equality-constrained minimization
- A nonlinear programming model with implicit variables for packing ellipsoids
- An active set limited memory BFGS algorithm for bound constrained optimization
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- On a scalable nonparametric denoising of time series signals
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- A convex optimization approach for solving large scale linear systems
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- An inexact ADMM for separable nonconvex and nonsmooth optimization
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
- Minimization subproblems and heuristics for an applied clustering problem
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate.
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- A modified spectral projected gradient method for tensor approximations over closed convex sets
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- An augmented Lagrangian approach for cardinality constrained minimization applied to variable selection problems
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Algorithm 807
- Packing ellipsoids by nonlinear optimization
- Gradient methods with adaptive step-sizes
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- Inexact variable metric method for convex-constrained optimization problems
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- Adjoint-free calculation method for conditional nonlinear optimal perturbations
- SPG
- A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems
- Inexact spectral projected gradient methods on convex sets
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- A Newton's method for the continuous quadratic knapsack problem
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Complexity and performance of an augmented Lagrangian algorithm
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- A projected-gradient interior-point algorithm for complementarity problems
- On the natural merit function for solving complementarity problems
- Positive definite matrices: data representation and applications to computer vision
- A new line search inexact restoration approach for nonlinear programming
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- An efficient implementation of a trust region method for box constrained optimization
- Modified active set projected spectral gradient method for bound constrained optimization
- Convergence analysis for the modified spectral projected subgradient method
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- LMBOPT: a limited memory method for bound-constrained optimization
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- 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
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
- On regularization and active-set methods with complexity for constrained optimization
- Exact spectral-like gradient method for distributed optimization
- Reconstruction of Voronoi diagrams in inverse potential problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- An algorithm for the fast solution of symmetric linear complementarity problems
- Inexact restoration method for minimization problems arising in electronic structure calculations
- An active set method for bound-constrained optimization
- Evaluating bound-constrained minimization software
- An active set trust-region method for bound-constrained optimization
- A flexible inexact-restoration method for constrained optimization
- Regularized graph cuts based discrete tomography reconstruction methods
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- Inexact restoration for derivative-free expensive function minimization and applications
- Minimizing the object dimensions in circle and sphere packing problems
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- FDIPA-SOC: a Matlab package for nonlinear second-order cone programs
This page was built for publication: Algorithm 813
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461003)
