The following pages link to (Q4004158):
Displaying 50 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space (Q344943) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081) (← links)
- Clustering and the perturbed spatial median (Q611736) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization (Q846939) (← links)
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A system of nonsmooth equations solver based upon subgradient method (Q903004) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068) (← links)
- Reachable set bounding for delayed systems with polytopic uncertainties: the maximal Lyapunov-Krasovskii functional approach (Q980935) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function (Q1049060) (← links)
- Solving some optimal control problems using the barrier penalty function method (Q1187560) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- Interactive solution approach to a multiobjective optimization problem in a paper machine headbox design (Q1411458) (← links)
- Interactive multiobjective optimization system WWW-NIMBUS on the Internet (Q1569909) (← links)
- Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method (Q1574281) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
- Proximal point method for a special class of nonconvex multiobjective optimization functions (Q1744628) (← links)
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming (Q1760808) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- The global optimal solution to the three-dimensional layout optimization model with behavioral constraints. (Q1880491) (← links)
- Optimality conditions for a nonlinear boundary value problem using nonsmooth analysis (Q1881466) (← links)
- On numerical solution of hemivariational inequalities by nonsmooth optimization methods (Q1905959) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
