Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
From MaRDI portal
Publication:5010048
DOI10.1137/20M1314057MaRDI QIDQ5010048
Ting Kei Pong, Peiran Yu, Zhaosong Lu
Publication date: 24 August 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.06998
constrained optimizationlinear convergenceKurdyka-Łojasiewicz propertydifference-of-convex optimization
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Doubly iteratively reweighted algorithm for constrained compressed sensing models, Calculus rules of the generalized concave Kurdyka-Łojasiewicz property, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A proximal method for composite minimization
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Exact penalty and error bounds in DC programming
- On the convergence properties of the projected gradient method for convex optimization
- Convex analysis and nonlinear optimization. Theory and examples.
- Logistic regression. A self-learning text. With contributions by Erica Rihl Pryor.
- The restricted isometry property and its implications for compressed sensing
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- From error bounds to the complexity of first-order descent methods for convex functions
- The value function approach to convergence analysis in composite optimization
- A proximal difference-of-convex algorithm with extrapolation
- 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
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Kurdyka-Łojasiewicz exponent via inf-projection
- The multiproximal linearization method for convex composite problems
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- A local search method for optimization problem with d.c. inequality constraints
- Efficiency of minimizing compositions of convex functions and smooth maps
- Variations and extension of the convex-concave procedure
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Techniques of variational analysis
- Transactions on Computational Collective Intelligence XIII
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- Computing B-Stationary Points of Nonsmooth DC Programs
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- DC Programming and DCA for General DC Programs
- The Analysis of Rates Using Poisson Regression Models
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Optimization and nonsmooth analysis
- Two-Point Step Size Gradient Methods
- Zero-Inflated Poisson Regression, with an Application to Defects in Manufacturing
- Variational Analysis
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Applied Logistic Regression
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex Analysis
