Cited in
(only showing first 100 items - show all)- Numerical methods for the design of large-scale nonlinear discrete ill-posed inverse problems
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Enriched methods for large-scale unconstrained optimization
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Recent advances in bound constrained optimization
- Modulus methods for nonnegatively constrained image restoration
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Sensitivity analysis of the strain criterion for multidimensional scaling
- Numerical optimization for constrained image registration
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- Nonlinear optimization and support vector machines
- Conjugate gradient algorithms in nonconvex optimization
- Nonlinear optimization and support vector machines
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- scientific article; zbMATH DE number 2143184 (Why is no real title available?)
- Trust-region superposition methods for protein alignment
- Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems
- Optimal weed population control using nonlinear programming
- A two-stage active-set algorithm for bound-constrained optimization
- A limited memory quasi-Newton trust-region method for box constrained optimization
- Numerical methods for large-scale nonlinear optimization
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- A survey of truncated-Newton methods
- An active set algorithm for nonlinear optimization with polyhedral constraints
- New projection-type methods for monotone LCP with finite termination
- 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
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An alternating projected gradient algorithm for nonnegative matrix factorization
- Trust region Newton method for logistic regression
- Harmonic hexahedral structured grid generation
- An active set limited memory BFGS algorithm for bound constrained optimization
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- On the convergence rate of scaled gradient projection method
- Mesh shape-quality optimization using the inverse mean-ratio metric
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- An active set quasi-Newton method with projected search for bound constrained minimization
- Optimization methods for large-scale machine learning
- PAL-Hom method for QP and an application to LP
- An active-set projected trust region algorithm for box constrained optimization problems
- A simple decomposition method for support vector machines
- scientific article; zbMATH DE number 2089933 (Why is no real title available?)
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- 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
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- A primal-dual algorithm for risk minimization
- 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
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- Phaseless Imaging by Reverse Time Migration: Acoustic Waves
- Scaled projected-directions methods with application to transmission tomography
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
- Modular proximal optimization for multidimensional total-variation regularization
- Least squares symmetric solutions to a matrix equation with a matrix inequality constraint
- An active set truncated Newton method for large-scale bound constrained optimization
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Globally convergent DC trust-region methods
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- LANCELOT
- ODRPACK
- QPCOMP
- SPG
- STRSCNE
- TNPACK
- L-BFGS-B
- GALAHAD
- NURBS
- CUTEr
- BVLS
- QPA
- 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
This page was built for software: TRON