Interior-point methods for nonconvex nonlinear programming: cubic regularization
From MaRDI portal
Publication:457205
DOI10.1007/S10589-013-9626-8zbMATH Open1305.90333OpenAlexW2050768044MaRDI QIDQ457205FDOQ457205
Authors: Hande Y. Benson, David F. Shanno 
Publication date: 26 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9626-8
Recommendations
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- An interior-point algorithm for nonconvex nonlinear programming
- scientific article; zbMATH DE number 5630197
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Interior‐point method for non‐linear non‐convex optimization
Cites Work
- Title not available (Why is that?)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- CUTE
- Benchmarking optimization software with performance profiles.
- A Modeling Language for Mathematical Programming
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A method for the solution of certain non-linear problems in least squares
- Test examples for nonlinear programming codes
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- On solving trust-region and other regularised subproblems in optimization
- Interior-point algorithms, penalty methods and equilibrium problems
- Cubic regularization of Newton method and its global performance
- Accelerating the cubic regularization of Newton's method on convex problems
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- LOQO user's manual — version 3.10
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited In (12)
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Nonlinear least square based on control direction by dual method and its application
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- On global minimizers of quadratic functions with cubic regularization
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- An inexact proximal regularization method for unconstrained optimization
Uses Software
This page was built for publication: Interior-point methods for nonconvex nonlinear programming: cubic regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457205)
