Pages that link to "Item:Q2491992"
From MaRDI portal
The following pages link to Duality for nonconvex approximation and optimization. (Q2491992):
Displayed 16 items.
- Duality and Farkas-type results for DC fractional programming with DC constraints (Q552120) (← links)
- Best approximation in max-plus semimodules (Q716439) (← links)
- An extragradient algorithm for solving general nonconvex variational inequalities (Q979174) (← links)
- Locating a semi-obnoxious facility in the special case of Manhattan distances (Q2009180) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization (Q2232754) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- The distance between two convex sets (Q2497250) (← links)
- An approach for the convex feasibility problem via monotropic programming (Q2627919) (← links)
- Duality and Convex Programming (Q2789804) (← links)
- Relationships Between Farthest Point Problem and Best Approximation Problem (Q3007937) (← links)
- Continuity of Optimal Solution Functions and their Conditions on Objective Functions (Q3449573) (← links)
- (Q5142528) (← links)
- ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY (Q5361211) (← links)
- (Q6137267) (← links)
- (Q6178243) (← links)