The following pages link to (Q5187067):
Displaying 50 items.
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- Smooth minimization of non-smooth functions (Q128676) (← links)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving (Q307702) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On numerical solving the spherical separability problem (Q330492) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Wave simulation in 2D heterogeneous transversely isotropic porous media with fractional attenuation: a Cartesian grid approach (Q349424) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (Q381697) (← links)
- A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921) (← links)
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis (Q389667) (← links)
- Gradient-only approaches to avoid spurious local minima in unconstrained optimization (Q402201) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
- Least quantile regression via modern optimization (Q482902) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← 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)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
- An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Generalized gradient learning on time series (Q747282) (← links)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
