Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization
DOI10.1016/j.camwa.2016.11.025zbMath1368.90184OpenAlexW2562970754MaRDI QIDQ2013811
Publication date: 9 August 2017
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2016.11.025
global convergencederivative-free methodrestrictively preconditioned conjugate gradient methodwithout line search technique
Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)
Related Items (1)
Uses Software
Cites Work
- A derivative-free algorithm for linearly constrained optimization problems
- A hybrid particle swarm optimization-back-propagation algorithm for feedforward neural network training
- Test examples for nonlinear programming codes
- On trust region methods for unconstrained minimization without derivatives
- Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
- Developments of NEWUOA for minimization without derivatives
- Numerical Optimization
- CUTE
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Preconditioning Reduced Matrices
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
This page was built for publication: Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization
