A penalty barrier framework for nonconvex constrained optimization

2024/06/14 by Alberto De Marchi, De Marchi, Alberto, Andreas Themelis +1
Computer Science · Mathematics · #49J52 #49J53 #65K05 #90C06 #90C30 #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Search Problems #Optimization and Variational Analysis

paper · doi:10.48550/arxiv.2406.09901

openalex publication_date 2024/06/14 · openalex created_date 2024/06/18 · openalex updated_date 2026/08/01

Abstract

This repository contains the codes accompanying the paper "A penalty barrier framework for nonconvex constrained optimization", by Alberto De Marchi and Andreas Themelis (arXiv:2406.09901). All data and figures for the numerical simulations in the manuscript are generated by running the `run<sub>a</sub>ll.m` script in the `demos` folder. These codes were written for research purposes and run in MATLAB R2022b.

Related

• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing\n Stepsizes and Iteration Complexity
• Penalty methods for a class of non-Lipschitz optimization problems
• Barrier Algorithms for Constrained Non-Convex Optimization
• Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
• Nonsmooth method for constrained optimization