Low Complexity Secant Quasi-Newton Minimization Algorithms for Nonconvex Functions

Journal of Computational and Applied Mathematics - Netherlands
doi 10.1016/j.cam.2006.10.060
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2012English

New Efficient Algorithms for Minimization of Non-Linear Functions

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Nonconvex Minimization in Generating Space

Tamkang Journal of Mathematics
Materials ScienceApplied MathematicsAlloysMetalsMathematics
2008English

On Using Quasi-Newton Algorithms of the Broyden Class for Model-To-Test Correlation

Journal of Aerospace Technology and Management
Aerospace Engineering
2014English

Low-Complexity Detection Algorithms for Spatial Modulation MIMO Systems

Journal of Electrical and Computer Engineering
Electronic EngineeringSignal ProcessingElectricalComputer Science
2018English

Fast Quasi-Newton Algorithms for Penalized Reconstruction in Emission Tomography and Further Improvements via Preconditioning

IEEE Transactions on Medical Imaging
Electronic EngineeringUltrasound TechnologyRadiologicalComputer Science ApplicationsElectricalSoftware
2018English

Semismooth Newton Method for Gradient Constrained Minimization Problem

2012English

Algorithms for Average Regret Minimization

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy