The following pages link to (Q4273942):
Displaying 50 items.
- A stochastic model for risk management in global supply chain networks (Q879293) (← links)
- A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
- Homogenization of nonlinear visco-elastic composites (Q924916) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Nonsmooth optimization: Theory and algorithms (Q972622) (← links)
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds (Q975855) (← links)
- A new trust region algorithm for nonsmooth convex minimization (Q990576) (← links)
- Minimizers of Dirichlet functionals on the \(n\)-torus and the weak KAM theory (Q1012359) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Direct approach to the minimization of the maximal stress over an arch structure (Q1265018) (← links)
- Stabilized column generation (Q1297485) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics. (Q1406910) (← links)
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints (Q1626527) (← links)
- A free boundary approach to the Rosensweig instability of ferrofluids (Q1635931) (← links)
- A note on computing the smallest conic singular value (Q1636761) (← links)
- Epi-convergence: the Moreau envelope and generalized linear-quadratic functions (Q1637348) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- A note on the Morozov principle via Lagrange duality (Q1653323) (← links)
- Sparse estimation of high-dimensional correlation matrices (Q1660228) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
- Extremality of convex sets with some applications (Q1679618) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- Formulae for the conjugate and the subdifferential of the supremum function (Q1730391) (← links)
- Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems (Q1730392) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence (Q1733318) (← links)
- A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings (Q1736800) (← links)
- The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces (Q1742515) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Two approaches to stochastic optimal control problems with a final-time expectation constraint (Q1754665) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- A steepest descent method for vector optimization (Q1765484) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems (Q1787821) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- Bounded and almost periodic solutions of convex Lagrangian systems. (Q1874486) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Error bound results for convex inequality systems via conjugate duality (Q1939069) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
