Pages that link to "Item:Q3277806"
From MaRDI portal
The following pages link to The Cutting-Plane Method for Solving Convex Programs (Q3277806):
Displayed 50 items.
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← 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)
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning (Q1339139) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Separating plane algorithms for convex optimization (Q1356051) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems (Q1359460) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- Method of simple-body centroids (Q1375256) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method (Q1574281) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods (Q1646571) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← 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)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- Feature selection and classification for high-dimensional incomplete multimodal data (Q1720434) (← links)
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
- Pasting gauges. I: Shortest paths across a hyperplane (Q1728102) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Two-stage robust optimization approach to elective surgery and downstream capacity planning (Q1753397) (← links)
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case (Q1756575) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- Stochastic programming for off-line adaptive radiotherapy (Q1761854) (← links)
- Uncertain convex programs: randomized solutions and confidence levels (Q1769067) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system (Q1789576) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Stochastic dynamic programming approach to managing power system uncertainty with distributed storage (Q1789640) (← links)
- Cutting angle methods in global optimization (Q1808534) (← links)
- Posynomial geometric programming as a special case of semi-infinite linear programming (Q1824566) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Numerical methods to design the reaching phase of output feedback variable structure control (Q1890992) (← links)
- Epigraphical nesting: A unifying theory for the convergence of algorithms (Q1893312) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)