Computational experience with penalty-barrier methods for nonlinear programming
From MaRDI portal
Publication:1915922
DOI10.1007/BF02206826zbMath0848.90108MaRDI QIDQ1915922
David F. Shanno, Marc G. Breitfeld
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
Primal-dual nonlinear rescaling method for convex optimization ⋮ A penalty-interior-point algorithm for nonlinear constrained optimization ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ The Legendre Transformation in Modern Optimization ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds ⋮ A primal-dual modified log-barrier method for inequality constrained nonlinear optimization ⋮ A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada ⋮ A fictitious energy approach for shape optimization ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ Maximum entropy solution to a quorum queueing system ⋮ Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method ⋮ A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization ⋮ Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem ⋮ Decomposition for structured convex programs with smooth multiplier methods
Uses Software
Cites Work
- Test examples for nonlinear programming codes
- Modified barrier functions (theory and methods)
- A collection of test problems for constrained global optimization algorithms
- Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming
- Newton-type methods for unconstrained and linearly constrained optimization
- A set of geometric programming test problems and their solutions
- Line Search Procedures for the Logarithmic Barrier Function
- CUTE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
