Pages that link to "Item:Q3932224"
From MaRDI portal
The following pages link to A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization (Q3932224):
Displaying 50 items.
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities (Q945201) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← links)
- An aggregate subgradient method for nonsmooth and nonconvex minimization (Q1082780) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Descent methods for quasidifferentiable minimization (Q1109687) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Nondifferentiable optimization via smooth approximation: General analytical approach (Q1207839) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- A regularized stochastic decomposition algorithm for two-stage stochastic linear programs (Q1318278) (← links)
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
- New variable-metric algorithms for nondifferentiable optimization problems (Q1321115) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
- Some experiments on heuristic code selection versus numerical performance in nonlinear programming (Q1804054) (← links)
- New variants of bundle methods (Q1922693) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- Generalized gradients in dynamic optimization, optimal control, and machine learning problems (Q2215292) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- Minimizing memory effects of a system (Q2264125) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- Rate of convergence of the bundle method (Q2412838) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- An aggregate subgradient method for nonsmooth convex minimization (Q3039046) (← links)
