Pages that link to "Item:Q1131571"
From MaRDI portal
The following pages link to Newton's method for convex programming and Tschebyscheff approximation (Q1131571):
Displaying 50 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← 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)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
- Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081) (← links)
- A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
- Cutting sphere algorithm (Q597178) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- On the use of outer approximations as an external active set strategy (Q711701) (← links)
- Cauchy's method of minimization (Q775268) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- Bounded lower subdifferentiability optimization techniques: applications (Q975769) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- A cutting plane algorithm for MV portfolio selection model (Q1036539) (← links)
- An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems (Q1037660) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
- Optimal value function in semi-infinite programming (Q1093526) (← links)
- Outer approximation by polyhedral convex sets (Q1101351) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- A maximization method for a class of quasiconcave programs (Q1148799) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method (Q1574281) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
