On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
From MaRDI portal
Publication:2674587
Recommendations
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- Augmented lagrangians and sphere packing problems
- On the convergence of a smooth penalty algorithm without computing global solutions
Cites work
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A new sequential optimality condition for constrained nonsmooth optimization
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- A stabilized SQP method: global convergence
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- An Exact Penalization Viewpoint of Constrained Optimization
- An implementation of Shor's \(r\)-algorithm
- Approximate KKT points and a proximity measure for termination
- Approximating Subdifferentials by Random Sampling of Gradients
- Calmness and Exact Penalization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Derivative-free and blackbox optimization
- Divide to conquer: decomposition methods for energy optimization
- Face-centered cubic crystallization of atomistic configurations
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Globalization strategies for mesh adaptive direct search
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- Mathematics of energy and climate change. International conference and advanced school Planet Earth, Lisbon, Portugal, March 21--28, 2013
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- New formulations for the Kissing Number Problem
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
- On kissing numbers and spherical codes in high dimensions
- On sequential optimality conditions for smooth constrained optimization
- On the differentiability check in gradient sampling methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization of lipschitz continuous functions
- Practical augmented Lagrangian methods for constrained optimization
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Upper bounds on the minimum distance of spherical codes
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
Cited in
(1)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674587)
