The following pages link to Algorithm 813 (Q5461003):
Displaying 35 items.
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- Exact spectral-like gradient method for distributed optimization (Q2282815) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- An efficient implementation of a trust region method for box constrained optimization (Q2346512) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem (Q2403122) (← links)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
- Positive Definite Matrices: Data Representation and Applications to Computer Vision (Q2954277) (← links)
- Algorithm 807 (Q4406295) (← links)
- Inexact spectral projected gradient methods on convex sets (Q4460568) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Inexact variable metric method for convex-constrained optimization problems (Q5034933) (← links)
- Inexact primal–dual gradient projection methods for nonlinear optimization on convex set (Q5151505) (← links)
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization (Q5466712) (← links)
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations (Q5470060) (← links)
- A projected derivative-free algorithm for nonlinear equations with convex constraints (Q5746683) (← links)
- Complexity and performance of an Augmented Lagrangian algorithm (Q5858985) (← links)
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations (Q5886218) (← links)
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization (Q6063782) (← links)
- Sensitivity analysis and tailored design of minimization diagrams (Q6133444) (← links)
- Sequential optimality conditions for optimization problems with additional abstract set constraints (Q6589669) (← links)
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm (Q6601376) (← links)
- A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems (Q6617006) (← links)
- A hybrid direct search and projected simplex gradient method for convex constrained minimization (Q6640994) (← links)
- Reconstruction of Voronoi diagrams in inverse potential problems (Q6652882) (← links)
- An active set method for bound-constrained optimization (Q6661109) (← links)
