Nonmonotone alternative direction method based on simple conic model for unconstrained optimization
From MaRDI portal
Recommendations
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A nonmonotone adaptive trust region method based on conic model for unconstrained optimization
- A nonmonotone trust-region method of conic model for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 5670650 (Why is no real title available?)
- scientific article; zbMATH DE number 5283327 (Why is no real title available?)
- scientific article; zbMATH DE number 773160 (Why is no real title available?)
- A New Algorithm for Unconstrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A new alternating direction trust region method based on conic model for solving unconstrained optimization
- A new nonmonotone adaptive trust region method based on simple quadratic models
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- A new trust region algorithm with simple quadratic models and line search
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A self-adaptive trust region method with line search based on a simple subproblem model
- A simple alternating direction method for the conic trust region subproblem
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- Conic Approximations and Collinear Scalings for Optimizers
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Interpolation by conic model for unconstrained optimization
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone trust region method for solving optimization problems
- On the nonmonotone line search
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- Test examples for nonlinear programming codes
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- Trust Region Methods
Cited in
(1)
This page was built for publication: Nonmonotone alternative direction method based on simple conic model for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635987)