Pages that link to "Item:Q1807687"

The following pages link to Globally convergent variable metric method for convex nonsmooth unconstrained minimization (Q1807687):

Displaying 44 items.

• A trust-region method with improved adaptive radius for systems of nonlinear equations (Q261542) (← links)
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations (Q295877) (← links)
• Parallel Uzawa method for large-scale minimization of partially separable functions (Q368609) (← links)
• Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
• Group update method for sparse minimax problems (Q493251) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
• Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
• On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
• Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
• A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
• An inexact Newton-like conditional gradient method for constrained nonlinear systems (Q1651415) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class (Q1715715) (← links)
• Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
• On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems (Q2181674) (← links)
• A regularization method for constrained nonlinear least squares (Q2191800) (← links)
• An efficient conjugate gradient trust-region approach for systems of nonlinear equation (Q2313481) (← links)
• Scaled nonlinear conjugate gradient methods for nonlinear least squares problems (Q2322819) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
• Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
• A quasi-Newton method for unconstrained non-smooth problems (Q2804871) (← links)
• Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
• Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems (Q2867435) (← links)
• Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
• A method for non-differentiable optimization problems (Q2885584) (← links)
• A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
• A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization (Q5076721) (← links)
• Inexact free derivative quasi-Newton method for large-scale nonlinear system of equations (Q6076931) (← links)