The following pages link to (Q3141900):
Displaying 50 items.
- The first-order necessary conditions for sparsity constrained optimization (Q259127) (← links)
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- On global search in nonconvex optimal control problems (Q276516) (← links)
- Modern methods for solving nonconvex optimal control problems (Q278529) (← links)
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Stability of utility maximization in nonequivalent markets (Q287676) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds (Q298628) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- Affine processes on symmetric cones (Q300276) (← links)
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming (Q301728) (← links)
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- Hypothesis testing via affine detectors (Q309575) (← links)
- A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
- Sharp MSE bounds for proximal denoising (Q330102) (← links)
- On numerical solving the spherical separability problem (Q330492) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- Variational multiplicative noise removal by DC programming (Q333222) (← links)
- A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone (Q344895) (← links)
- The largest eigenvalue of a convex function, duality, and a theorem of Slodkowski (Q345307) (← links)
- Positively homogeneous functions revisited (Q346810) (← links)
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824) (← links)
- Revisiting the construction of gap functions for variational inequalities and equilibrium problems via conjugate duality (Q352746) (← links)
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions (Q353145) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- A variational approach of the rank function (Q356507) (← links)
- Composite proximal bundle method (Q359623) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization (Q367393) (← links)
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
- Liquidity risks on power exchanges: a generalized Nash equilibrium model (Q368744) (← 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)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
