swMATH4714MaRDI QIDQ16882FDOQ16882
Author name not available (Why is that?)
Official website: http://www.mcs.anl.gov/~more/tron/
Cited In (only showing first 100 items - show all)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- Conjugate gradient algorithms in nonconvex optimization
- Numerical methods for large-scale nonlinear optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- A limited memory quasi-Newton trust-region method for box constrained optimization
- A survey of truncated-Newton methods
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Trust region Newton method for logistic regression
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An alternating projected gradient algorithm for nonnegative matrix factorization
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- An active set limited memory BFGS algorithm for bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- A simple decomposition method for support vector machines
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- An active-set projected trust region algorithm for box constrained optimization problems
- Radius Margin Bounds for Support Vector Machines with the RBF Kernel
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Phaseless Imaging by Reverse Time Migration: Acoustic Waves
- An active set truncated Newton method for large-scale bound constrained optimization
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- Globally convergent DC trust-region methods
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Local convergence analysis of projection-type algorithms: unified approach
- ODRPACK
- QPCOMP
- TNPACK
- BVLS
- QRUP
- CONV_QP
- MINPACK-2
- GPDT
- NNLS
- PPRN
- KELLEY
- TOMS-686
- LBFGS-B
- NLPHOPDM
- nlpy
- nlr
- tn
- AMLET
- TRICE
- SLPTESTSET
- MCPLIB
- bmrm
- TAO
- MTRON
- SSVM
- UNAMALLA
- ORL face
- CLIP
- OSGA
- An active set-type Newton method for constrained nonlinear systems
- A convergent decomposition method for box-constrained optimization problems
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- ROL
- Alternative gradient algorithms with applications to nonnegative matrix factorizations
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds
- Plotlyjs.jl
- On a new collection of stochastic linear programming test problems
- Variational inequality approach to enforcing the non-negative constraint for advection-diffusion equations
- iNEOS: An interactive environment for nonlinear optimization
- Iterative methods for finding a trust-region step
- Improving ultimate convergence of an augmented Lagrangian method
- A sparse counterpart of Reichel and Gragg's package QRUP
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A filter-trust-region method for simple-bound constrained optimization
- An algorithm for the fast solution of symmetric linear complementarity problems
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
- A framework for the upscaling of the electrical conductivity in the quasi-static Maxwell's equations
- Superlinearly convergent trust-region method without the assumption of positive-definite Hessian
- Some recent advances in projection-type methods for variational inequalities
- Sample size selection in optimization methods for machine learning
- Least squares problems with inequality constraints as quadratic constraints
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Enriched methods for large-scale unconstrained optimization
- Modulus methods for nonnegatively constrained image restoration
- Recent advances in bound constrained optimization
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- Numerical optimization for constrained image registration
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
This page was built for software: TRON
