The following pages link to (Q3141900):
Displayed 50 items.
- Nonsmooth Variants of Powell's BFGS Convergence Theorem (Q4641661) (← links)
- Nonconvex integration using <i>ϵ</i>-subdifferentials (Q4646551) (← links)
- A simple closure condition for the normal cone intersection formula (Q4654124) (← links)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization (Q4673325) (← links)
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs (Q4678764) (← links)
- Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm (Q4685337) (← links)
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization (Q4685597) (← links)
- Quadratic Support Functions in Quadratic Bilevel Problems (Q4685742) (← links)
- (Q4691898) (← links)
- The 𝒰-Lagrangian of a convex function (Q4699613) (← links)
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization (Q4714542) (← links)
- Canonical factorization of continuous functions on the $d$-torus (Q4780419) (← links)
- A Method for Minimization of Quasidifferentiable Functions (Q4806341) (← links)
- Optimality and duality without a constraint qualification for minimax programming (Q4807991) (← links)
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey (Q4839284) (← links)
- Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach (Q4958550) (← links)
- Some topics in vector optimization via image space analysis (Q4959907) (← links)
- On a Solving Bilevel D.C.-Convex Optimization Problems (Q4965111) (← links)
- Convex Analysis in $\mathbb{Z}^n$ and Applications to Integer Linear Programming (Q4971025) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- A Decomposition Algorithm for the Sums of the Largest Eigenvalues (Q4985169) (← links)
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces (Q4989940) (← links)
- First order difference systems with multipoint boundary conditions (Q4992003) (← links)
- (Q4998944) (← links)
- Demand response versus storage flexibility in energy: multi-objective programming considerations (Q5009155) (← links)
- Lyapunov--Krasovskii Characterization of the Input-to-State Stability for Switching Retarded Systems (Q5012327) (← links)
- On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming (Q5012883) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- Algorithms for Simple Bilevel Programming (Q5014631) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- Dual algorithm for truncated fractional variation based image denoising (Q5030605) (← links)
- An algorithm for projecting a point onto a level set of a quadratic function (Q5034927) (← links)
- On the Frank–Wolfe algorithm for non-compact constrained optimization problems (Q5034936) (← links)
- Generalized derivatives of computer programs (Q5038428) (← links)
- A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
- Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← links)
- A nonmonotone gradient method for constrained multiobjective optimization problems (Q5052584) (← links)
- (Q5053252) (← links)
- Constant along primal rays conjugacies and the <i>l</i><sub>0</sub> pseudonorm (Q5067346) (← links)
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- Two iterative processes generated by regular vector fields in Banach spaces (Q5077153) (← links)
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations (Q5088836) (← links)
- Optimality conditions for set optimization using a directional derivative based on generalized Steiner sets (Q5093683) (← links)
- Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming (Q5097021) (← links)
- Duality Gap Estimation via a Refined Shapley--Folkman Lemma (Q5107209) (← links)
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
- (Q5110195) (← links)
- Computation of Sum of Squares Polynomials from Data Points (Q5113128) (← links)