On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
DOI10.1007/s11075-022-01287-xzbMath1500.65032OpenAlexW4220927785WikidataQ114224280 ScholiaQ114224280MaRDI QIDQ2674587
Sandra Augusta Santos, Lucas E. A. Simões, Renan W. Prado
Publication date: 14 September 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01287-x
nonsmooth optimizationoptimality conditionsnonconvex programmingblackbox optimizationhard-sphere problems
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Uses Software
Cites Work
- Mathematics of energy and climate change. International conference and advanced school Planet Earth, Lisbon, Portugal, March 21--28, 2013
- Face-centered cubic crystallization of atomistic configurations
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- Divide to conquer: decomposition methods for energy optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Globalization strategies for mesh adaptive direct search
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
- An implementation of Shor's \(r\)-algorithm
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- On kissing numbers and spherical codes in high dimensions
- New formulations for the Kissing Number Problem
- Approximate KKT points and a proximity measure for termination
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- On the differentiability check in gradient sampling methods
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Algorithm 909
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- Calmness and Exact Penalization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- An Exact Penalization Viewpoint of Constrained Optimization
- Optimization of lipschitz continuous functions
- Derivative-Free and Blackbox Optimization
- A stabilized SQP method: global convergence
- Upper bounds on the minimum distance of spherical codes
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Approximating Subdifferentials by Random Sampling of Gradients
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- On sequential optimality conditions for smooth constrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
