Improving directions of negative curvature in an efficient manner
From MaRDI portal
Publication:1026565
DOI10.1007/S10479-008-0425-ZzbMATH Open1163.90754OpenAlexW2091412576MaRDI QIDQ1026565FDOQ1026565
Authors: Alberto Olivares, Javier M. Moguerza 
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0425-z
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
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Trust Region Methods
- Title not available (Why is that?)
- Newton-type methods for unconstrained and linearly constrained optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Title not available (Why is that?)
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Decomposition of a symmetric matrix
- An augmented Lagrangian interior-point method using directions of negative curvature
- Construction of test problems in quadratic bivalent programming
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- A second-order method for the general nonlinear programming problem
- A generalized conjugate gradient algorithm
- Combining search directions using gradient flows
- Nonconvex optimization using negative curvature within a modified linesearch
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- On the use of directions of negative curvature in a modified newton method
- Quadratic cost flow and the conjugate gradient method
- A modification of Armijo's step-size rule for negative curvature
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Computing Modified Newton Directions Using a Partial Cholesky Factorization
- A modified Newton method for minimization
- Title not available (Why is that?)
Cited In (5)
- Iterative computation of negative curvature directions in large scale optimization
- Title not available (Why is that?)
- 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
Uses Software
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)
