Pages that link to "Item:Q2266668"

The following pages link to Methods of descent for nondifferentiable optimization (Q2266668):

Displaying 50 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (Q273664) (← links)
• Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions (Q280969) (← links)
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
• Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
• Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
• A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
• PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (Q381697) (← links)
• Approximation of the critical buckling factor for composite panels (Q381871) (← links)
• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs (Q480938) (← links)
• Generalized derivatives for solutions of parametric ordinary differential equations with non-differentiable right-hand sides (Q481757) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• Reverse propagation of McCormick relaxations (Q496587) (← links)
• Differentiable McCormick relaxations (Q522264) (← links)
• A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081) (← links)
• On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
• On Nesterov's nonsmooth Chebyshev-Rosenbrock functions (Q654068) (← links)
• A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand (Q669373) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• A smooth method for the finite minimax problem (Q689121) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Generalized derivatives of differential-algebraic equations (Q727214) (← links)
• Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs (Q812414) (← links)
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
• A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
• Decomposition approaches for constrained spatial auction market problems (Q844131) (← links)
• A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
• Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
• Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
• A proximal bundle method with inexact data for convex nondifferentiable minimization (Q876907) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• An additive subfamily of enlargements of a maximally monotone operator (Q904307) (← links)
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)