The following pages link to (Q3141900):
Displaying 50 items.
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Metric Regularity and Optimality Conditions in Nonsmooth Optimization (Q2912151) (← links)
- Sequential formulae for the normal cone to sublevel sets (Q2930660) (← links)
- Convex sets and second order systems with nonlocal boundary conditions at resonance (Q2964033) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions (Q2995263) (← links)
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata (Q3011667) (← links)
- Linearized Bregman iterations for compressed sensing (Q3055156) (← links)
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization (Q3055191) (← links)
- A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization (Q3177618) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- Bound sets and two-point boundary value problems for second order differential systems (Q3297160) (← links)
- Least Squares Reconstruction of Binary Images using Eigenvalue Optimization (Q3298719) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
- Uniqueness in a Free Boundary Problem (Q3424257) (← links)
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations (Q3454491) (← links)
- A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing (Q3466252) (← links)
- Residual<i>a posteriori</i> error estimators for contact problems in elasticity (Q3507028) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization (Q3539791) (← links)
- Nonsmooth Optimization (Q3569504) (← links)
- A new series of conjectures and open questions in optimization and matrix analysis (Q3628305) (← links)
- Lipschitz modulus in convex semi-infinite optimization<i>via</i>d.c. functions (Q3643500) (← links)
- Duality for optimization and best approximation over finite intersections (Q4221452) (← links)
- Quasi-concave functions and convex convergence to infinity (Q4265862) (← links)
- ε-Subdifferential and ε-monotonicity (Q4266381) (← links)
- Robustness in the Pareto-solutions for the multi-criteria minisum location problem (Q4329625) (← links)
- Minkowski’s inequality for two variable difference means (Q4383059) (← links)
- (Q4557933) (← links)
- Stochastic Methods for Composite and Weakly Convex Optimization Problems (Q4561227) (← links)
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions (Q4588864) (← links)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS (Q4596997) (← links)
- Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem (Q4622791) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- Prox-regularization of the dual method of centers for generalized fractional programs (Q4631765) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems (Q4634171) (← links)
- <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)
- Gap Safe screening rules for sparsity enforcing penalties (Q4637055) (← links)
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- A dynamical system perspective on mathematical programming (Q4641464) (← links)
- 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)
