Globally convergent DC trust-region methods
From MaRDI portal
Publication:2250078
DOI10.1007/s10898-014-0170-6zbMath1300.90029OpenAlexW2027882669WikidataQ58040528 ScholiaQ58040528MaRDI QIDQ2250078
Huynh Van Ngai, Hoai An Le Thi, Tao Pham Dinh, Luis Nunes Vicente, A. Ismael F. Vaz
Publication date: 4 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0170-6
Related Items
DC programming and DCA: thirty years of developments, Nonsmooth bundle trust-region algorithm with applications to robust stability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new trust region algorithm for bound constrained minimization
- Family of projected descent methods for optimization problems with simple bounds
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A particle swarm pattern search method for bound constrained global optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- A New Active Set Algorithm for Box Constrained Optimization
- Optimization and nonsmooth analysis
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Algorithm 778: L-BFGS-B
- Variational Analysis
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Trust Region Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Newton's Method for Large Bound-Constrained Optimization Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- A filter-trust-region method for simple-bound constrained optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Fast Algorithms for Projection on an Ellipsoid
- Convex Analysis
- Benchmarking optimization software with performance profiles.
