## Found 229 Documents (Results 1–100)

100
MathJax

### Essentials of numerical nonsmooth optimization. (English)Zbl 07565587

MSC:  90Cxx 65Kxx 49Jxx
Full Text:

Full Text:

MSC:  90-XX
Full Text:

MSC:  90Bxx
Full Text:

MSC:  90-XX
Full Text:

MSC:  90-XX
Full Text:

### Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other. (English. Russian original)Zbl 1483.90111

Autom. Remote Control 82, No. 10, 1679-1691 (2021); translation from Avtom. Telemekh. 2021, No. 10, 60-75 (2021).
MSC:  90C25
Full Text:

MSC:  90Bxx
Full Text:

MSC:  90Cxx
Full Text:

### Solving optimization problems over the weakly efficient set. (English)Zbl 1465.90080

MSC:  90C26 65K05 90C30
Full Text:

### Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions. (Ukrainian. English summary)Zbl 1474.90342

MSC:  90C25 90C29 49K40
Full Text:

Full Text:

### An improved cutting plane method for convex optimization, convex-concave games, and its applications. (English)Zbl 07298300

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 944-953 (2020).
MSC:  68Qxx
Full Text:

### Generalized cutting plane method for solving nonlinear stochastic programming problems. (English)Zbl 1453.90126

MSC:  90C26 90C15 26B25
Full Text:

MSC:  90B05
Full Text:

### Essentials of numerical nonsmooth optimization. (English)Zbl 1442.90143

MSC:  90C25 65K05
Full Text:

### Cutting planes for families implying Frankl’s conjecture. (English)Zbl 1429.05199

MSC:  05D05 90C10
Full Text:

### Robust optimization problem for linear polyhedral cone constrained distribution on $$KL$$-divergence. (English)Zbl 1430.90449

MSC:  90C17 90C25
Full Text:

### An oracle for the discrete-time integral quadratic constraint problem. (English)Zbl 1429.93213

MSC:  93C55 93B35
Full Text:

MSC:  90C57
Full Text:

### A cutting-plane method to nonsmooth multiobjective optimization problems. (English)Zbl 1430.90521

MSC:  90C29 90C30
Full Text:

### The $$p$$-arborescence star problem: formulations and exact solution approaches. (English)Zbl 1458.90616

MSC:  90C35 90B80
Full Text:

### Generalized cutting plane method by means of minimum type subdifferentials. (English)Zbl 1484.90083

MSC:  90C26 52B55 68Q25
Full Text:

Full Text:

### A relaxation cutting plane method for portfolio optimization with stochastic second order dominance constraints. (Chinese. English summary)Zbl 1424.91113

MSC:  91G10 90C15
Full Text:

### Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations. (English)Zbl 1418.90201

MSC:  90C26 65K05
Full Text:

MSC:  90C11
Full Text:

### Hill tunneling method via peak subpoints for continuous piecewise linear programming. (Chinese. English summary)Zbl 1413.90173

MSC:  90C05 90C26 90C59
Full Text:

### Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization. (English)Zbl 1458.90492

MSC:  90C15 90C11
Full Text:

### Cutting plane method for distributionally robust least squares problems. (Chinese. English summary)Zbl 1399.90265

MSC:  90C31 90C05 90C25

### Word segmentation in Chinese language processing. (English)Zbl 1388.62192

MSC:  62H30 68T50
Full Text:

### Research on the cutting plane method for solving integer linear programming problems with multiple sets of solutions. (Chinese. English summary)Zbl 1389.90239

MSC:  90C05 90C10

### Vanishing price of decentralization in large coordinative nonconvex optimization. (English)Zbl 1371.90114

MSC:  90C26 90C46
Full Text:

MSC:  90C10

Full Text:

Full Text:

### Cluster Lagrangean decomposition in multistage stochastic optimization. (English)Zbl 1349.90656

MSC:  90C15 90C11
Full Text:

Full Text:

Full Text:

### A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand. (English)Zbl 1410.90039

MSC:  90B20 91A65
Full Text:

Full Text:

MSC:  90C25
Full Text:

Full Text:

### Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem. (English)Zbl 1338.90268

MSC:  90C10 90C49 90B06
Full Text:

### Synthesis of cutting and separating planes in a nonsmooth optimization method. (English. Russian original)Zbl 1327.90225

Cybern. Syst. Anal. 51, No. 4, 619-631 (2015); translation from Kibern. Sist. Anal. 2015, No. 4, 137-150 (2015).
MSC:  90C25 90C57
Full Text:

### A cutting-plane method without inclusions of approximating sets for conditional minimization. (English)Zbl 1330.65092

MSC:  65K05 90C30 90C57
Full Text:

### Parallel bucket sorting on graphics processing units based on convex optimization. (English)Zbl 1320.90058

MSC:  90C25 90C90
Full Text:

### Linear and integer optimization. Theory and practice. 3rd ed. (English)Zbl 1329.90183

Advances in Applied Mathematics (Boca Raton). Boca Raton, FL: CRC Press (ISBN 978-1-4987-1016-9/hbk; 978-1-4987-1022-0/ebook). xxix, 656 p. (2015).

MSC:  90C05
Full Text:

### A study on the dual problem of nonsmooth bundle method based on approximate subgradients. (Chinese. English summary)Zbl 1313.90247

MSC:  90C46 90C59

### Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization. (English)Zbl 1349.90655

MSC:  90C15 90C11
Full Text:

### An interior-point Benders based branch-and-cut algorithm for mixed integer programs. (English)Zbl 1284.90042

MSC:  90C11 90C57 90C51
Full Text:

### Implementing the simplex method as a cutting-plane method, with a view to regularization. (English)Zbl 1318.90048

MSC:  90C05 90C15 90C25
Full Text:

Full Text:

### An introduction to optimization. 4th ed. (English)Zbl 1266.90001

Wiley Series in Discrete Mathematics and Optimization. Hoboken, NJ: John Wiley & Sons (ISBN 978-1-118-27901-4/hbk; 978-1-118-51515-0/ebook). xv, 622 p. (2013).

Full Text:

Full Text:

### A cut-and-solve based algorithm for the single-source capacitated facility location problem. (English)Zbl 1253.90143

MSC:  90B80 90C10 90C57
Full Text:

MSC:  90C34
Full Text:

### Improved ranking algorithm based on pairwise method. (Chinese. English summary)Zbl 1219.68169

MSC:  68W99 68T05
Full Text:

### A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition. (English)Zbl 1215.90023

MSC:  90B30 90C90
Full Text:

### Globally convergent cutting plane method for nonconvex nonsmooth minimization. (English)Zbl 1229.90140

Reviewer: Do Van Luu (Hanoi)
MSC:  90C26 49M37 65K05
Full Text:

MSC:  90C30
Full Text:

### Bundle methods for regularized risk minimization. (English)Zbl 1242.68253

MSC:  68T05 62J02
Full Text:

### Primal-dual simplex method for shooting. (English)Zbl 1237.90211

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 719-726 (2010).
MSC:  90C27 90C05
Full Text:

### An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree. (English)Zbl 1209.91086

MSC:  91B30 90C39
Full Text:

### An efficient descent direction method with cutting planes. (English)Zbl 1204.90105

MSC:  90C30 90C57
Full Text:

Full Text:

### Minimization of isotonic functions composed of Fractions. (English)Zbl 1229.90223

MSC:  90C32 90C47
Full Text:

### Solving multi-stage stochastic in-house production and outsourcing planning by two-level decomposition. (English)Zbl 1183.90152

MSC:  90B30 90C15
Full Text:

Full Text:

### Optimizing daily agent scheduling in a multiskill call center. (English)Zbl 1177.90262

MSC:  90B90 90B35 90C15
Full Text:

MSC:  68T05
Full Text:

MSC:  90B35

MSC:  90B20
Full Text:

### Pseudomonotone$$_*$$ maps and the cutting plane property. (English)Zbl 1173.49010

MSC:  49J40 47H04 65K05
Full Text:

### The radar method: An effective line search for piecewise linear concave functions. (English)Zbl 1163.90526

MSC:  90B40 90C26
Full Text:

### 0-1 reformulations of the multicommodity capacitated network design problem. (English)Zbl 1168.90002

MSC:  90B10 90C09
Full Text:

### Convergence of a numerical abstract convexity algorithm. (English)Zbl 1279.90132

Izv. Math. 73, No. 1, 3-19 (2009); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 73, No. 1, 5-20 (2009).
MSC:  90C26 90C30
Full Text:

MSC:  90C22
Full Text:

### Optimizing call center staffing using simulation and analytic center cutting-plane methods. (English)Zbl 1232.90266

MSC:  90B90 90B22 90C59
Full Text:

### A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems. (Chinese. English summary)Zbl 1174.90723

MSC:  90C20 49N10 90C57

MSC:  90C11
Full Text:

### Algorithms for infinite quadratic programming in $$L_p$$ spaces. (English)Zbl 1144.65038

MSC:  65K05 90C20
Full Text:

### Interactive stability cutting-plane algorithm for multiobjective nonlinear programming problems. (English)Zbl 1193.90184

MSC:  90C29 90C57
Full Text:

### Constrained clustering via concavity cuts. (English)Zbl 1214.68306

Van Hentenryck, Pascal (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 4th international conference, CPAIOR 2007, Brussels, Belgium, May 23–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72396-7/pbk). Lecture Notes in Computer Science 4510, 318-331 (2007).
Full Text:

### An optimization algorithm applied to the Morrey conjecture in nonlinear elasticity. (English)Zbl 1121.74322

MSC:  74B20 74G65
Full Text:

### Solving variational inequalities defined on a domain with infinitely many linear constraints. (English)Zbl 1116.49005

MSC:  49J40 90C34 93C05
Full Text:

### A conjugate Rosen’s gradient projection method with global line search for piecewise linear concave optimization. (English)Zbl 1121.90089

MSC:  90C05 90C49 90C52
Full Text:

### An efficient algorithm for multidimensional nonlinear knapsack problems. (English)Zbl 1156.90430

MSC:  90C27 90C35
Full Text:

### The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach. (English)Zbl 1239.90098

MSC:  90C33 49J40
Full Text:

### Modeling and optimization of a dynamic separation process using mixed integer nonlinear programming. (English)Zbl 1402.90220

Handlovičová, Angela (ed.) et al., ALGORITMY 2005. 17th conference on scientific computing, Vysoké Tatry, Podbanské, Slovakia, March 13–18, 2005. Proceedings of contributed papers and posters. Bratislava: University of Technology, Faculty of Civil Engineering, Department of Mathematics and Descriptive Geometry (ISBN 80-227-2192-1). 348-358 (2005).
MSC:  90C90 65N06 90C11
Full Text:

### A deterministic global optimization algorithm for generalized geometric programming. (English)Zbl 1105.65335

MSC:  65K05 90C26 90C57
Full Text:

### Exact solution of the centralized network design problem on directed graphs. (English)Zbl 1068.90105

MSC:  90C35 90B10 90C57
Full Text:

Full Text:

### Polyhedral methods in discrete optimization. (English)Zbl 1068.90083

Hoşten, Serkan (ed.) et al., Trends in optimization. American Mathematical Society short course, January 5–6, 2004, Phoenix, Arizona, USA. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3584-X/hbk). Proceedings of Symposia in Applied Mathematics 61, 21-37 (2004).
MSC:  90C11 90C10 90C57

### Interior point cutting plane method for optimal power flow. (English)Zbl 1121.90307

MSC:  90B10 90C10 90C55
Full Text:

### Decomposition techniques for the minimum toll revenue problem. (English)Zbl 1055.90009

MSC:  90B10 90B06 90C57
Full Text:

all top 5

all top 5

all top 5

all top 3

all top 3