Interior-point methods for nonconvex nonlinear programming: cubic regularization
From MaRDI portal
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
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A method for the solution of certain non-linear problems in least squares
- Accelerating the cubic regularization of Newton's method on convex problems
- 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
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- An interior-point algorithm for nonconvex nonlinear programming
- Benchmarking optimization software with performance profiles.
- CUTE
- Cubic regularization of Newton method and its global performance
- Interior-point algorithms, penalty methods and equilibrium problems
- 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
- On solving trust-region and other regularised subproblems in optimization
- 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
- Test examples for nonlinear programming codes
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(12)- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- On global minimizers of quadratic functions with cubic regularization
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- An inexact proximal regularization method for unconstrained optimization
- Nonlinear least square based on control direction by dual method and its application
- Cubic regularization in symmetric rank-1 quasi-Newton methods
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)
