Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems

DOI10.1007/s10589-007-9162-5zbMath1181.90245OpenAlexW1990503264MaRDI QIDQ2655405

Elvio A. Pilotta, Elizabeth W. Karas, Ademir Alves Ribeiro

Publication date: 25 January 2010

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

Full work available at URL: https://doi.org/10.1007/s10589-007-9162-5

zbMATH Keywords

filter methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Inexact restoration for derivative-free expensive function minimization and applications ⋮ Sequential equality-constrained optimization for nonlinear programming ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems ⋮ Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints ⋮ Non-monotone inexact restoration method for nonlinear programming ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ Inexact restoration method for nonlinear optimization without derivatives ⋮ Assessing the reliability of general-purpose inexact restoration methods ⋮ Inexact Restoration approach for minimization with inexact evaluation of the objective function ⋮ On the Complexity of an Inexact Restoration Method for Constrained Optimization ⋮ On sequential optimality conditions for smooth constrained optimization ⋮ A flexible inexact-restoration method for constrained optimization

Uses Software

• LANCELOT
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of slanting filter methods for nonlinear programming
• Distributing many points on a sphere
• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• Inexact-restoration algorithm for constrained optimization
• The kissing number in four dimensions
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• A Trust Region Algorithm for Nonlinearly Constrained Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• A Globally Convergent Filter Method for Nonlinear Programming
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.

This page was built for publication: Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems