Pages that link to "Item:Q3936513"

The following pages link to A model algorithm for composite nondifferentiable optimization problems (Q3936513):

Displaying 50 items.

• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
• Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
• A trust-region-based BFGS method with line search technique for symmetric nonlinear equations (Q606189) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• Convex composite multi-objective nonsmooth programming (Q687035) (← links)
• A smooth method for the finite minimax problem (Q689121) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
• A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• A projected conjugate gradient method for sparse minimax problems (Q1315210) (← links)
• Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
• Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
• A trust region algorithm for nonsmooth optimization (Q1341571) (← links)
• Iteration functions in some nonsmooth optimization algorithms (Q1363553) (← links)
• Discontinuous piecewise linear optimization (Q1380942) (← links)
• A robust sequential quadratic programming method (Q1825141) (← links)
• An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
• Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
• A unified approach to global convergence of trust region methods for nonsmooth optimization (Q1890930) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
• Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
• Use of exact penalty functions to determine efficient decisions (Q2638947) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
• The Sequential Quadratic Programming Method (Q3569505) (← links)
• Conditions for convergence of trust region algorithms for nonsmooth optimization (Q3696877) (← links)
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization (Q3698656) (← links)
• Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
• Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
• (Q4355317) (← links)
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
• Stochastic Methods for Composite and Weakly Convex Optimization Problems (Q4561227) (← links)
• The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization (Q5097019) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)