The following pages link to (Q5187067):
Displaying 50 items.
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- An ODE-based trust region method for unconstrained optimization problems (Q843138) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- Approximating Clarke's subgradients of semismooth functions by divided differences (Q877273) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- iPiasco: inertial proximal algorithm for strongly convex optimization (Q890114) (← links)
- Determining six cardiac conductivities from realistically large datasets (Q899075) (← links)
- A system of nonsmooth equations solver based upon subgradient method (Q903004) (← 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)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- A characterization of optimal scaling for structured singular value computation (Q919745) (← links)
- An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← links)
- Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
- New filled functions for nonsmooth global optimization (Q965609) (← links)
- Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities (Q972166) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Tetrolet shrinkage with anisotropic total variation minimization for image approximation (Q985618) (← links)
- Semi-explicit solution and fast minimization scheme for an energy with \(\ell _{1}\)-fitting and Tikhonov-like regularization (Q993516) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Hamilton-Jacobi-Bellman formalism for optimal climate control of greenhouse crop (Q1023141) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm (Q1083371) (← links)
- An algorithm for nondifferentiable optimization (Q1111944) (← links)
- Dual quadratic estimates in polynomial and Boolean programming (Q1173717) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Dual estimates in multiextremal problems (Q1201906) (← links)
- Nondifferentiable optimization via smooth approximation: General analytical approach (Q1207839) (← links)
- Single-input--single-output \({\mathcal H}_ \infty\)-control with time domain constraints (Q1261088) (← links)
- Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
- An improved subgradient method for constrained nondifferentiable optimization (Q1317025) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- New variable-metric algorithms for nondifferentiable optimization problems (Q1321115) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Partial linearization methods in nonlinear programming (Q1321373) (← links)
- Global minimization by reducing the duality gap (Q1322556) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Nonmonotone stabilization methods for nonlinear equations (Q1331105) (← links)
- On using approximations of the Benders master problem (Q1333479) (← links)
