Improving directions of negative curvature in an efficient manner
From MaRDI portal
Publication:1026565
Recommendations
- Combining and scaling descent and negative curvature directions
- scientific article; zbMATH DE number 4087442
- scientific article; zbMATH DE number 3967814
- Iterative computation of negative curvature directions in large scale optimization
- Using negative curvature in solving nonlinear programs
- scientific article; zbMATH DE number 1438975
- scientific article; zbMATH DE number 491076
- scientific article; zbMATH DE number 4169568
- Developments around positive sectional curvature
Cites work
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3464747 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A generalized conjugate gradient algorithm
- A modification of Armijo's step-size rule for negative curvature
- A modified Newton method for minimization
- A second-order method for the general nonlinear programming problem
- An augmented Lagrangian interior-point method using directions of negative curvature
- Combining search directions using gradient flows
- Computing Modified Newton Directions Using a Partial Cholesky Factorization
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Construction of test problems in quadratic bivalent programming
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Decomposition of a symmetric matrix
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Nonconvex optimization using negative curvature within a modified linesearch
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the use of directions of negative curvature in a modified newton method
- Quadratic cost flow and the conjugate gradient method
- Templates for the Solution of Algebraic Eigenvalue Problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Trust Region Methods
Cited in
(5)- Iterative computation of negative curvature directions in large scale optimization
- scientific article; zbMATH DE number 4087442 (Why is no real title available?)
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- An augmented Lagrangian interior-point method using directions of negative curvature
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
This page was built for publication: Improving directions of negative curvature in an efficient manner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026565)
