Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems

DOI10.1007/s10957-017-1137-9zbMath1373.90144OpenAlexW2736193475MaRDI QIDQ1673895

Javier M. Moguerza, Javier Cano, Francisco Javier Prieto

Publication date: 27 October 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1137-9

zbMATH Keywords

interior-point methodsnegative curvatureKKT conditionsnonconvex optimisation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (1)

Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization

Uses Software

• Matlab
• CUTEr
• SifDec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stabilized SQP method: superlinear convergence
• Complexity bounds for second-order optimality in unconstrained optimization
• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
• Quadratic cost flow and the conjugate gradient method
• An algorithm for nonlinear optimization problems with binary variables
• A note on the use of vector barrier parameters for interior-point methods
• Improving directions of negative curvature in an efficient manner
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
• A modified Newton method for minimization
• A second-order method for the general nonlinear programming problem
• A generalized conjugate gradient algorithm
• Some properties of the Hessian of the logarithmic barrier function
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
• An augmented Lagrangian interior-point method using directions of negative curvature
• Combining search directions using gradient flows
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• Nonconvex optimization using negative curvature within a modified linesearch
• An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• On the Implementation of a Primal-Dual Interior Point Method
• Newton-type methods for unconstrained and linearly constrained optimization
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Computing Modified Newton Directions Using a Partial Cholesky Factorization
• Numerical Stability and Efficiency of Penalty Algorithms
• Exploiting negative curvature directions in linesearch methods for unconstrained optimization
• A two parameter mixed interior-exterior penalty algorithm
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• CUTEr and SifDec
• Nonlinear Programming
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Benchmarking optimization software with performance profiles.

This page was built for publication: Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems