The following pages link to (Q3316093):
Displaying 50 items.
- Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← 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)
- Differentiable McCormick relaxations (Q522264) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- On a class of nonsmooth optimal control problems (Q584725) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- Generalized derivatives of differential-algebraic equations (Q727214) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems (Q751515) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition (Q879572) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- A bundle method for solving equilibrium problems (Q959957) (← links)
- Nonsmooth optimization: Theory and algorithms (Q972622) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- An aggregate subgradient method for nonsmooth and nonconvex minimization (Q1082780) (← links)
- Optimization with nonsmooth data (Q1097840) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Bundle-based decomposition: Conditions for convergence (Q1122487) (← links)
- Complementary finite-element method for finite deformation nonsmooth mechanics (Q1126226) (← links)
- New types of variational principles based on the notion of quasidifferentiability (Q1193468) (← links)
- Direct approach to the minimization of the maximal stress over an arch structure (Q1265018) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- Load balancing in the parallel optimization of block-angular linear programs (Q1321661) (← links)
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs (Q1338136) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- Partitioning mathematical programs for parallel solution (Q1380936) (← links)
- Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities. (Q1578637) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← 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)
- A numerical approach to optimization problems with variational inequality constraints (Q1804370) (← links)
- Iterative bundle-based decomposition for large-scale nonseparable convex optimization (Q1806873) (← links)
- Scenario analysis via bundle decomposition (Q1896443) (← links)
- Optimal prestress of structures with frictional unilateral contact interfaces (Q1904939) (← links)
- Generalized proximal point algorithm for convex optimization (Q1908641) (← links)
- New variants of bundle methods (Q1922693) (← links)
- Generalized derivatives of eigenvalues of a symmetric matrix (Q2151564) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization (Q2576736) (← links)
