Pages that link to "Item:Q3688120"
From MaRDI portal
The following pages link to Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120):
Displayed 31 items.
- Weak sharp efficiency in multiobjective optimization (Q315498) (← links)
- Composite proximal bundle method (Q359623) (← links)
- Gauss-Newton method for convex composite optimizations on Riemannian manifolds (Q452337) (← links)
- Metric subregularity for composite-convex generalized equations in Banach spaces (Q534471) (← links)
- Strong KKT conditions and weak sharp solutions in convex-composite optimization (Q623359) (← links)
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
- Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
- Global convergence of a semi-infinite optimization method (Q912572) (← links)
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets (Q975841) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Uniform convergence of higher order quasi Hermite-Fejér interpolation (Q1334101) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- A trust region algorithm for nonsmooth optimization (Q1341571) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Local and global behavior for algorithms of solving equations (Q1428833) (← links)
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem (Q1760780) (← links)
- An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- Convergence analysis of a proximal Gauss-Newton method (Q1928745) (← links)
- Asymptotic analysis in convex composite multiobjective optimization problems (Q1945516) (← links)
- Nonlinear programming and nonsmooth optimization by successive linear programming (Q2277149) (← links)
- Two-square theorems for infinite matrices on certain fields (Q2367867) (← links)
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← links)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- Local properties of algorithms for minimizing nonsmooth composite functions (Q3688120) (← links)
- Local properties of inexact methods for minimizing nonsmooth composite functions (Q3760305) (← links)
- Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)