An extended sequential quadratic method with extrapolation
From MaRDI portal
Cites work
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A moving balls approximation method for a class of smooth constrained minimization problems
- A proximal difference-of-convex algorithm with extrapolation
- Adaptive restart for accelerated gradient schemes
- An Application of Error Bounds for Convex Programming in a Linear Space
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Applied logistic regression
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Clarke Subgradients of Stratifiable Functions
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- Convergence acceleration during the 20th century
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Extrapolation Methods for Vector Sequences
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- From error bounds to the complexity of first-order descent methods for convex functions
- Gradient methods for minimizing composite functions
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Penalty methods for a class of non-Lipschitz optimization problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- Sequential quadratic programming methods
- Smooth minimization of non-smooth functions
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Some methods of speeding up the convergence of iteration methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Successive overrelaxation (SOR) and related methods
- Templates for convex cone problems with applications to sparse signal recovery
- The generalized trust region subproblem
- The restricted isometry property and its implications for compressed sensing
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(1)
This page was built for publication: An extended sequential quadratic method with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961461)
