Using negative curvature in solving nonlinear programs
From MaRDI portal
Abstract: Minimization methods that search along a curvilinear path composed of a non-ascent nega- tive curvature direction in addition to the direction of steepest descent, dating back to the late 1970s, have been an effective approach to finding a stationary point of a function at which its Hessian is positive semidefinite. For constrained nonlinear programs arising from recent appli- cations, the primary goal is to find a stationary point that satisfies the second-order necessary optimality conditions. Motivated by this, we generalize the approach of using negative curvature directions from unconstrained optimization to nonlinear ones. We focus on equality constrained problems and prove that our proposed negative curvature method is guaranteed to converge to a stationary point satisfying second-order necessary conditions. A possible way to extend our proposed negative curvature method to general nonlinear programs is also briefly discussed.
Recommendations
- Nonconvex optimization using negative curvature within a modified linesearch
- scientific article; zbMATH DE number 4087442
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
Cites work
- scientific article; zbMATH DE number 3910157 (Why is no real title available?)
- scientific article; zbMATH DE number 45789 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A curvilinear method based on minimal-memory BFGS updates
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- A feasible method for optimization with orthogonality constraints
- A geometric analysis of phase retrieval
- A modification of Armijo's step-size rule for negative curvature
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An Extrinsic Look at the Riemannian Hessian
- An algorithm for solving nonlinear least-squares problems with a new curvilinear search
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Greedy approaches to symmetric orthogonal tensor decomposition
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Independent component analysis, a new concept?
- Local minima and convergence in low-rank semidefinite programming
- Nonconvex phase synchronization
- Nonmonotone curvilinear line search methods for unconstrained optimization
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- On the use of directions of negative curvature in a modified newton method
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- Problems of distance geometry and convex properties of quadratic maps
- Riemannian Geometry
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Tensor decompositions for learning latent variable models
Cited in
(14)- A hybrid inexact regularized Newton and negative curvature method
- A symmetric rank-one quasi-Newton line-search method using negative curvature directions
- Exploiting negative curvature in deterministic and stochastic optimization
- MINRES: from negative curvature detection to monotonicity properties
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- scientific article; zbMATH DE number 4087442 (Why is no real title available?)
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- Nonconvex optimization using negative curvature within a modified linesearch
- Improving directions of negative curvature in an efficient manner
- 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
- Geometry and symmetry in short-and-sparse deconvolution
- Finding second-order stationary points in constrained minimization: a feasible direction approach
This page was built for publication: Using negative curvature in solving nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694388)
