Coderivative-based semi-Newton method in nonsmooth difference programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3650320 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 176973 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Generalized Newton Method for Subgradient Systems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Accelerating the DC algorithm for smooth functions
- Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
- Coderivative calculations related to a parametric affine variational inequality. I: Basic calculations
- Computing a Trust Region Step
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Fréchet differentiability of convex functions
- Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization
- Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Metric subregularity of the convex subdifferential in Banach spaces
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Newton-Type Methods for Optimization and Variational Problems
- Nonlinear optimization
- On M-stationary points for a stochastic equilibrium problem under equilibrium constraints in electricity spot market modeling.
- On a Semismooth* Newton Method for Solving Generalized Equations
- On second-order subdifferentials and their applications
- On the co-derivative of normal cone mappings to inequality systems
- On the coderivative of the projection operator onto the second-order cone
- Optimal control of the sweeping process over polyhedral controlled sets
- Prox-regularity of functions and sets in Banach spaces
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Second-order analysis of polyhedral systems in finite and infinite dimensions with applications to robust stability of variational inequalities
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Second-order variational analysis in optimization, variational stability, and control. Theory, algorithms, applications
- The ABC of DC programming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The boosted DC algorithm for linearly constrained DC programming
- Uniform prox-regularity of functions and epigraphs in Hilbert spaces
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Variational Analysis
- Variational analysis and applications
Cited in
(3)
This page was built for publication: Coderivative-based semi-Newton method in nonsmooth difference programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932187)
