The following pages link to (Q3141900):
Displayed 50 items.
- 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)
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
- Undesirable facility location with minimal covering objectives (Q1806769) (← links)
- An efficient algorithm for a generalized joint replenishment problem (Q1806852) (← links)
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality (Q1807819) (← links)
- Cutting angle methods in global optimization (Q1808534) (← links)
- Directional Lipschitzian optimal solution of infinite-dimensional optimization problems (Q1808595) (← links)
- Minimizing regret: The general case (Q1818295) (← links)
- New existence results for equilibrium problems (Q1863461) (← links)
- Designing robustly stabilising controllers for LTI spatially distributed systems using coprime factor synthesis (Q1869259) (← links)
- Almost periodic solutions of second-order systems with monotone fields on a compact subset. (Q1870898) (← links)
- On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives (Q1877017) (← links)
- On equivalent results in minimax theory (Q1877019) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- A descent proximal level bundle method for convex nondifferentiable optimization (Q1905073) (← links)
- Using duality to solve generalized fractional programming problems (Q1924069) (← links)
- Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty (Q1926006) (← links)
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application (Q1931769) (← links)
- A spatial regularization approach for vector quantization (Q1932871) (← links)
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems (Q1934638) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration (Q1945380) (← links)
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems (Q1945504) (← links)
- A new optimal electricity market bid model solved through perspective cuts (Q1948528) (← links)
- Regularization methods for optimization problems with probabilistic constraints (Q1949268) (← links)
- Variational formulation and structural stability of monotone equations (Q1949409) (← links)
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results (Q1949593) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- A control problem arising in the process of waste water purification (Q1970388) (← links)
- Bounds for the expected value of spacings from discrete distributions (Q1972156) (← links)
- Numerical aspects of the sweeping process (Q1972936) (← links)
- Strong Abadie CQ, ACQ, calmness and linear regularity (Q2248746) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- Multivariate McCormick relaxations (Q2250101) (← links)
- Homogeneous penalizers and constraints in convex image restoration (Q2251195) (← links)
- Directed subdifferentiable functions and the directed subdifferential without delta-convex structure (Q2251544) (← links)
- Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls (Q2251551) (← links)
- Adaptive edge element approximation of \(H(\mathrm{curl}\)-elliptic optimal control problems with control constraints (Q2264054) (← links)
- A proximal gradient descent method for the extended second-order cone linear complementarity problem (Q2268076) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing (Q2348695) (← links)
- Projection onto simplicial cones by Picard's method (Q2348931) (← links)
- Relating lexicographic smoothness and directed subdifferentiability (Q2359138) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- Optimality conditions in convex multiobjective SIP (Q2364489) (← links)
- Subadditive approaches in integer programming (Q2371344) (← links)
- Relaxation and nonoccurrence of the Lavrentiev phenomenon for nonconvex problems (Q2376651) (← links)