The following pages link to (Q3141900):
Displaying 50 items.
- On the dual representation of coherent risk measures (Q1640041) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- DC programming and DCA for enhancing physical layer security via cooperative jamming (Q1652424) (← links)
- Perspective functions: properties, constructions, and examples (Q1653321) (← links)
- A note on the Morozov principle via Lagrange duality (Q1653323) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems (Q1664763) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- On a sufficient condition for weak sharp efficiency in multiobjective optimization (Q1670009) (← links)
- Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis (Q1670125) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- Abadie constraint qualifications for convex constraint systems and applications to calmness property (Q1673889) (← links)
- Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds (Q1675560) (← links)
- Global probability maximization for a Gaussian bilateral inequality in polynomial time (Q1675587) (← links)
- Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319) (← links)
- On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
- Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
- The equivariant Minkowski problem in Minkowski space (Q1687890) (← links)
- Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities (Q1693842) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures (Q1702785) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence (Q1717026) (← links)
- Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations (Q1725116) (← links)
- Lift expectations of random sets (Q1726775) (← links)
- Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization (Q1728358) (← links)
- A novel unified approach to invariance conditions for a linear dynamical system (Q1735111) (← links)
- On sums and convex combinations of projectors onto convex sets (Q1740660) (← links)
- An equivalent one level optimization problem to a semivectorial bilevel problem (Q1746029) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- A negotiation-based algorithm to coordinate supplier development in decentralized supply chains (Q1752209) (← links)
- On the proximal gradient algorithm with alternated inertia (Q1752647) (← links)
- How to project onto extended second order cones (Q1753127) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Lyapunov-type least-squares problems over symmetric cones (Q1758453) (← links)
- Almost periodic solutions of forced vectorial Liénard equations (Q1763207) (← links)
- Numerical identification of parameters for a strongly degenerate convection-diffusion problem modelling centrifugation of flocculated suspensions (Q1763627) (← links)
- Representation of the Clarke generalized Jacobian via the quasidifferential (Q1770092) (← links)
- Dual scaling of comparison and reference stimuli in multi-dimensional psychological space (Q1775821) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
