Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints

DOI10.1007/s10444-022-10002-2OpenAlexW4319320693MaRDI QIDQ2692792

Yongle Zhang, Shiqi Xu, Guoyin Li, Ting Kei Pong

Publication date: 23 March 2023

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08584

zbMATH Keywords

retractiondifference-of-convex optimizationfirst-order feasible methodsKurdyka-Łojasiewicz exponents

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Uses Software

• PDCO
• SPGL1
• aplore3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• A unified approach to error bounds for structured convex optimization problems
• DC programming and DCA: thirty years of developments
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
• A bundle method for nonsmooth DC programming with application to chance-constrained problems
• Kurdyka-Łojasiewicz exponent via inf-projection
• Further properties of the forward-backward envelope with applications to difference-of-convex programming
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation
• Atomic Decomposition by Basis Pursuit
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
• Convexity and optimization with copulæ structured probabilistic constraints
• Sequential Quadratic Programming Methods
• Computing B-Stationary Points of Nonsmooth DC Programs
• A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Encyclopedia of Optimization
• Implicit Functions and Solution Mappings
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Variational Analysis
• A Feasible Trust-Region Sequential Quadratic Programming Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Applied Logistic Regression
• Robust Recovery of Signals From a Structured Union of Subspaces
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
• Polar Convolution
• Gauge Optimization and Duality
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
• Model Selection and Estimation in Regression with Grouped Variables
• Stable signal recovery from incomplete and inaccurate measurements
• The Supporting Hyperplane Method for Unimodal Programming
• Convex Analysis
• Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
• Convex analysis and global optimization

This page was built for publication: Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints