The following pages link to (Q3141900):
Displayed 50 items.
- 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)
- A phase transition behavior for Brownian motions interacting through their ranks (Q2380764) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
- Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems (Q2392783) (← links)
- An extension of the basic constraint qualification to nonconvex vector optimization problems (Q2393089) (← links)
- Robust semi-local convergence analysis for inexact Newton method (Q2396513) (← links)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
- The degrees of freedom of partly smooth regularizers (Q2409395) (← links)
- Global optimality conditions in nonconvex optimization (Q2412831) (← links)
- Rate of convergence of the bundle method (Q2412838) (← links)
- Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? (Q2420795) (← links)
- Global optimality conditions and exact penalization (Q2421449) (← links)
- Optimal stopping via pathwise dual empirical maximisation (Q2422357) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- A unified minimal solution in set optimization (Q2423801) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Constrained iterations for blind deconvolution and convexity issues (Q2432708) (← links)
- The joint replenishment problem with variable production costs (Q2432876) (← links)
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
- Global optimality conditions for optimal control problems with functions of A.D. Alexandrov (Q2435024) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)