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
(Redirected from Publication:5010048)
Recommendations
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Sequential difference-of-convex programming
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- Survey of sequential convex programming and generalized Gauss-Newton methods
Cites work
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- A local search method for optimization problem with d.c. inequality constraints
- A moving balls approximation method for a class of smooth constrained minimization problems
- A proximal difference-of-convex algorithm with extrapolation
- A proximal method for composite minimization
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Applied logistic regression
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Computing B-stationary points of nonsmooth DC programs
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples.
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA for general DC programs
- DC programming and DCA: thirty years of developments
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Exact penalty and error bounds in DC programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- From error bounds to the complexity of first-order descent methods for convex functions
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Kurdyka-Łojasiewicz exponent via inf-projection
- Logistic regression. A self-learning text. With contributions by Erica Rihl Pryor.
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the convergence properties of the projected gradient method for convex optimization
- Optimization and nonsmooth analysis
- Probing the Pareto frontier for basis pursuit solutions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Sequential convex approximations to joint chance constrained programs: A Monte Carlo approach
- Sparse Reconstruction by Separable Approximation
- Techniques of variational analysis
- The Analysis of Rates Using Poisson Regression Models
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The multiproximal linearization method for convex composite problems
- The restricted isometry property and its implications for compressed sensing
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- The value function approach to convergence analysis in composite optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Transactions on Computational Collective Intelligence XIII
- Two-Point Step Size Gradient Methods
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Variational Analysis
- Variations and extension of the convex-concave procedure
- Zero-Inflated Poisson Regression, with an Application to Defects in Manufacturing
Cited in
(15)- 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
- Survey of sequential convex programming and generalized Gauss-Newton methods
- 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
- Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
- Variance reduced moving balls approximation method for smooth constrained minimization problems
- Level constrained first order methods for function constrained optimization
- Moving higher-order Taylor approximations method for smooth constrained minimization problems
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- An extended sequential quadratic method with extrapolation
- Contractive difference-of-convex algorithms
- An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
This page was built for publication: Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010048)
