Pages that link to "Item:Q5010048"

The following pages link to Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048):

Displaying 9 items.

• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
• The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
• Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
• Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems (Q6333154) (← links)
• Variance reduced moving balls approximation method for smooth constrained minimization problems (Q6542460) (← links)
• Level constrained first order methods for function constrained optimization (Q6665379) (← links)