A penalty barrier framework for nonconvex constrained optimization

DOI10.46298/JNSAO-2025-14585MaRDI QIDQ6899976zbMATH OpenFDO

Authors A. de Marchi, Andreas Themelis

Publication date 13 November 2025

Published in Journal of Nonsmooth Analysis and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/JNSAO-2025-14585

zbMATH Keywords

exact penalty methodsinterior point methodsnonsmooth nonconvex optimizationproximal algorithms

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Cites work

• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A penalty-interior-point algorithm for nonlinear constrained optimization
• A proximal interior point algorithm with applications to image processing
• An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization
• An interior proximal gradient method for nonconvex optimization
• Benchmarking Derivative-Free Optimization Algorithms
• Constrained composite optimization and augmented Lagrangian methods
• Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
• Convex Analysis
• Extension of range of functions
• Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Matrix completion under interval uncertainty
• Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Practical augmented Lagrangian methods for constrained optimization
• Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
• Proximal gradient methods beyond monotony
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
• Trust Region Methods
• Variational Analysis

Cited in

(1)

• A nonconvex modeling approach to cost-volume-profit analysis with variable price in an oligopolistic market

This page was built for publication: A penalty barrier framework for nonconvex constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899976)