HSL-VF05
From MaRDI portal
Software:52013
No author found.
Related Items (73)
An inertia-free filter line-search algorithm for large-scale nonlinear programming ⋮ An active-set algorithm for norm constrained quadratic problems ⋮ A linear-time algorithm for trust region problems ⋮ A Nested Lanczos Method for the Trust-Region Subproblem ⋮ A new regularized quasi-Newton algorithm for unconstrained optimization ⋮ On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ Two globally convergent nonmonotone trust-region methods for unconstrained optimization ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ Elastic 3D-2D image registration ⋮ On efficiently combining limited-memory and trust-region techniques ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods ⋮ DrAmpl: A meta solver for optimization problem analysis ⋮ Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ A linear-time algorithm for the trust region subproblem based on hidden convexity ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ On the use of the energy norm in trust-region and adaptive cubic regularization subproblems ⋮ Full Waveform Inversion and the Truncated Newton Method ⋮ A modified trust region method with beale's PCG technique for optimization ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations ⋮ On the Generalized Lanczos Trust-Region Method ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ The generalized trust region subproblem ⋮ Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ Iterative computation of negative curvature directions in large scale optimization ⋮ A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems ⋮ trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ A matrix-free line-search algorithm for nonconvex optimization ⋮ An inexact and nonmonotone proximal method for smooth unconstrained minimization ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ A filter trust-region algorithm for unconstrained optimization with strong global convergence properties ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ A practical method for solving large-scale TRS ⋮ Global convergence of SSM for minimizing a quadratic over a sphere ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ Error bounds of Lanczos approach for trust-region subproblem ⋮ QPLIB: a library of quadratic programming instances ⋮ A Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ The trust region subproblem with non-intersecting linear constraints ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ Adaptive regularization with cubics on manifolds ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization ⋮ Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere ⋮ On Lagrange multipliers of trust-region subproblems ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ New optimality conditions for quadratic optimization problems with binary constraints ⋮ How much do approximate derivatives hurt filter methods? ⋮ Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step ⋮ An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty ⋮ Norm-constrained least-squares solutions to the matrix equation \(A X B = C\) ⋮ A penalty-free approach to PDE constrained optimization: application to an inverse wave problem ⋮ A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint ⋮ Tilt stability for quadratic programs with one or two quadratic inequality constraints ⋮ An interior-point method for large constrained discrete ill-posed problems ⋮ Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization ⋮ Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems ⋮ Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix ⋮ The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem ⋮ A survey of truncated-Newton methods ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method ⋮ An iterative working-set method for large-scale nonconvex quadratic programming ⋮ Algorithm 943 ⋮ \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm ⋮ The generalized trust region subproblem: solution complexity and convex hull results
This page was built for software: HSL-VF05
