Pages that link to "Item:Q1407370"

The following pages link to Continuous subdifferential approximations and their applications (Q1407370):

Displaying 18 items.

• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (Q273664) (← links)
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• Constructing a sequence of discrete Hessian matrices of an \(SC^{1}\) function uniformly convergent to the generalized Hessian matrix (Q847841) (← links)
• An incremental piecewise linear classifier based on polyhedral conic separation (Q890307) (← links)
• Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
• Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils (Q1783477) (← links)
• An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
• First order sensitivity analysis of symplectic eigenvalues (Q2197212) (← links)
• Continuous outer subdifferentials in nonsmooth optimization (Q2328202) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems (Q2342128) (← links)
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials (Q5745159) (← links)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)