The following pages link to (Q3141900):
Displayed 50 items.
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
- Faces and support functions for the values of maximal monotone operators (Q2198530) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Generalized gradients in dynamic optimization, optimal control, and machine learning problems (Q2215292) (← links)
- Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach (Q2218900) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- Lineability of the set of supporting vectors (Q2222834) (← links)
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings (Q2230938) (← links)
- Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
- On the linear convergence rates of exchange and continuous methods for total variation minimization (Q2235147) (← links)
- The globalization theorem for the curvature-dimension condition (Q2238045) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- Augmented Lagrangian methods for degenerate Hamilton-Jacobi equations (Q2240702) (← 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)
- On starting and stopping criteria for nested primal-dual iterations (Q2274163) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Structured sparsity promoting functions (Q2275318) (← links)
- Discrete time optimal control with frequency constraints for non-smooth systems (Q2280876) (← links)
- An inertial algorithm for DC programming (Q2281267) (← links)
- Hölder error bounds and Hölder calmness with applications to convex semi-infinite optimization (Q2281271) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
- Optimality and duality for vector optimization problem with non-convex feasible set (Q2307976) (← links)
- An algorithm for nonsmooth optimization by successive piecewise linearization (Q2316623) (← links)
- Local convergence analysis for Chebyshev's method (Q2317413) (← links)
- Error minimization with global optimization for difference of convex functions (Q2321661) (← links)
- Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization (Q2322836) (← links)
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time (Q2328199) (← 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)