Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
type: Item
instance of: scholarly article
title: Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
zbMATH Open document ID: 1181.90243
author: Hande Y. Benson
author: David F. Shanno
published in: Computational Optimization and Applications
publication date: 2008-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5366749
zbMATH Keywords: interior-point methods
zbMATH Keywords: nonlinear programming
zbMATH Keywords: warmstarting
zbMATH Keywords: penalty methods
describes a project that uses: KNITRO
describes a project that uses: SifDec
describes a project that uses: CG+
describes a project that uses: SNOPT
describes a project that uses: Ipopt
describes a project that uses: LOQO
describes a project that uses: CUTEr
describes a project that uses: MersenneTwister
describes a project that uses: MINLPLib
MaRDI profile type: Publication
full work available at URL: s10589-007-9089-x
OpenAlex ID: W2042204689
cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
cites work: Q4464628
cites work: Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
cites work: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
cites work: Interior-point algorithms, penalty methods and equilibrium problems
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: Q5588268
cites work: Q4226179
cites work: An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
cites work: CUTEr and SifDec
cites work: Test examples for nonlinear programming codes
cites work: Interior Methods for Mathematical Programs with Complementarity Constraints
cites work: Mersenne twister
cites work: Q4654838
cites work: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: Failure of global convergence for a class of interior point methods for nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S10589-007-9089-X
Recommended article: Interior-point methods for nonconvex nonlinear programming: cubic regularization
Recommended article: An interior-point algorithm for nonconvex nonlinear programming
Recommended article: Warm-start strategies in interior-point methods for linear programming
Recommended article: On Interior-Point Warmstarts for Linear and Combinatorial Optimization
Recommended article: On some efficient interior point methods for nonlinear convex programming
Recommended article: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
Recommended article: A feasible interior-point algorithm for nonconvex nonlinear programming
Recommended article: Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
Recommended article: Interior Point Methods for Nonlinear Optimization
Recommended article: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
description: scientific article; zbMATH DE number 5366749