Pages that link to "Item:Q911994"
From MaRDI portal
The following pages link to Proximity control in bundle methods for convex nondifferentiable minimization (Q911994):
Displaying 50 items.
- Semidefinite programming (Q1600854) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm (Q1681783) (← links)
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence (Q1717026) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Integration of progressive hedging and dual decomposition in stochastic integer programs (Q1785365) (← links)
- A family of variable metric proximal methods (Q1804367) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Scenario analysis via bundle decomposition (Q1896443) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- A minimizing algorithm for complex nonconvex nondifferentiable functions (Q1904979) (← links)
- A descent proximal level bundle method for convex nondifferentiable optimization (Q1905073) (← links)
- On numerical solution of hemivariational inequalities by nonsmooth optimization methods (Q1905959) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- New variants of bundle methods (Q1922693) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- A variable target value method for nondifferentiable optimization (Q1970420) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
- Home service routing and appointment scheduling with stochastic service times (Q2028845) (← links)
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (Q2030665) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- Stochastic dynamic cutting plane for multistage stochastic convex programs (Q2032005) (← links)
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Min-Max MPC based on a network problem (Q2474457) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
