Pages that link to "Item:Q911994"
From MaRDI portal
The following pages link to Proximity control in bundle methods for convex nondifferentiable minimization (Q911994):
Displaying 50 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
- Surface fitting and registration of point clouds using approximations of the unsigned distance function (Q631004) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- Canonical duality for solving nonconvex and nonsmooth optimization problem (Q833455) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- An additive subfamily of enlargements of a maximally monotone operator (Q904307) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- Direct approach to the minimization of the maximal stress over an arch structure (Q1265018) (← links)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- Dual decomposition in stochastic integer programming (Q1306366) (← links)
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- Constraint aggregation principle in convex optimization (Q1356049) (← links)
- Separating plane algorithms for convex optimization (Q1356051) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Sample-path optimization of convex stochastic performance functions (Q1363424) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method (Q1574281) (← links)
