TRON

swMATH4714MaRDI QIDQ16882FDOQ16882

Author name not available (Why is that?)

Described by source

• Newton's Method for Large Bound-Constrained Optimization Problems

Cited In (only showing first 100 items - show all)

• The Conjugate Residual Method in Linesearch and Trust-Region Methods
• Nonlinear optimization and support vector machines
• Title not available (Why is that?)
• Sensitivity analysis of the strain criterion for multidimensional scaling
• Trust-region superposition methods for protein alignment
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems
• Optimal weed population control using nonlinear programming
• New projection-type methods for monotone LCP with finite termination
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• A matrix-free trust-region Newton algorithm for convex-constrained optimization
• Simultaneous Sensing Error Recovery and Tomographic Inversion Using an Optimization-Based Approach
• Harmonic hexahedral structured grid generation
• 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
• PAL-Hom method for QP and an application to LP
• Title not available (Why is that?)
• A primal-dual algorithm for risk minimization
• Modulus Methods for Nonnegatively Constrained Image Restoration
• Modular proximal optimization for multidimensional total-variation regularization
• Scaled projected-directions methods with application to transmission tomography
• Approximate solution of system of equations arising in interior-point methods for 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
• Title not available (Why is that?)
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
• A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors
• Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• On solving \(L_{q}\)-penalized regressions
• Non-negative moment fitting quadrature rules for fictitious domain methods
• An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
• An active-set algorithm for nonlinear programming using parametric linear programming
• Enriched methods for large-scale unconstrained optimization
• 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
• Numerical optimization for constrained image registration
• Nonlinear optimization and support vector machines
• Title not available (Why is that?)
• Iterative Methods for Finding a Trust-region Step
• Conjugate gradient algorithms in nonconvex optimization
• A two-stage active-set algorithm for bound-constrained optimization
• Numerical methods for large-scale nonlinear optimization
• Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems
• 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
• 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
• Recent Advances in Bound Constrained Optimization
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
• 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
• An active set-type Newton method for constrained nonlinear systems
• A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems
• 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
• Solution strategies for two- and three-dimensional electromagnetic inverse problems
• A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
• 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
• Modified active set projected spectral gradient method for bound constrained optimization
• 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
• Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
• Improving ultimate convergence of an augmented Lagrangian method
• Numerical methods for experimental design of large-scale linear ill-posed inverse problems
• 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
• Optimization Methods for Large-Scale Machine Learning
• 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
• Title not available (Why is that?)
• A New Active Set Algorithm for Box Constrained Optimization

This page was built for software: TRON