Found 283 Documents (Results 1–100)

100
MathJax

Full Text:

Sufficient descent conjugate gradient methods for solving nondifferentiable convex optimization problem. (Chinese. English summary)Zbl 1474.65168

MSC:  65K05 90C25
Full Text:

Using invertible functions to construct NCP functions. (English)Zbl 1473.90118

MSC:  90C25 90C33 26A27
Full Text:

Constructing mixed algorithms on the basis of some bundle method. (English)Zbl 1460.90139

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 150-163 (2020).
MSC:  90C25
Full Text:

Full Text:

Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema. (Russian. English summary)Zbl 1479.26006

MSC:  26A27 90C26 26A30
Full Text:

Characterizations of solution sets for two nonsymmetric cone programs. (English)Zbl 1458.90513

MSC:  90C25 90C33 26A27
Full Text:

Computational efficiency of the simplex embedding method in convex nondifferentiable optimization. (English. Russian original)Zbl 1397.90311

Comput. Math. Math. Phys. 58, No. 2, 215-222 (2018); translation from Zh. Vychisl. Mat. Mat. Fiz. 58, No. 2, 228-236 (2018).
MSC:  90C26 90C25
Full Text:

Examples of $$r$$-convex functions and characterizations of $$r$$-convex functions associated with second-order cone. (English)Zbl 1387.26010

MSC:  26A27 26B05 90C33
Full Text:

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. (English)Zbl 1393.90072

MSC:  90C06 90C25
Full Text:

Minimal representation in a quotient space over a lattice of unbounded closed convex sets. (English)Zbl 1377.52003

MSC:  52A07 26A27 90C30
Full Text:

Parallel block coordinate minimization with application to group regularized regression. (English)Zbl 1364.90252

MSC:  90C25 90C56 62J07
Full Text:

An implementation of a reduced subgradient method via Luenberger-Mokhtar variant. (English)Zbl 1346.90815

MSC:  90C52 65K05
Full Text:

Full Text:

Bundle methods for sum-functions with “easy” components: applications to multicommodity network design. (English)Zbl 1300.90027

MSC:  90C25 90C06
Full Text:

Full Text:

Full Text:

Full Text:

MSC:  90C30
Full Text:

Conjugate gradient type methods for the nondifferentiable convex minimization. (English)Zbl 1287.90049

MSC:  90C25 90C52
Full Text:

MSC:  90C25
Full Text:

Full Text:

An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems. (English)Zbl 1271.90058

MSC:  90C25 90C27 65K05
Full Text:

A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case. (English)Zbl 1289.65146

MSC:  65K05 90C30 90C25

An inexact bundle approach to cutting-stock problems. (English)Zbl 1243.90138

MSC:  90C10 90C51 90C57
Full Text:

Full Text:

Full Text:

Projection method with level control in convex minimization. (English)Zbl 1201.65099

MSC:  65K05 90C25
Full Text:

Full Text:

Full Text:

MSC:  90C25
Full Text:

Incremental subgradient methods for nondifferentiable optimization in a Hilbert space. (Chinese. English summary)Zbl 1183.90332

MSC:  90C25 65K05

Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems. (English)Zbl 1188.90273

Reviewer: Rita Pini (Milano)
MSC:  90C46 90C26 90C29
Full Text:

Optimality conditions and duality for a minimax nondifferentiable programming problem, involving $$(\eta ,\rho ,\theta )$$-invex functions. (English)Zbl 1249.90314

MSC:  90C46 90C25

Graph implementations for nonsmooth convex programs. (English)Zbl 1205.90223

Blondel, Vincent D. (ed.) et al., Recent advances in learning and control. Festschrift for Mathukumalli Vidyasagar on the occasion of his sixtieth birthday. London: Springer (ISBN 978-1-84800-154-1/pbk). Lecture Notes in Control and Information Sciences 371, 95-110 (2008).
MSC:  90C25
Full Text:

Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs. (English)Zbl 1161.90480

MSC:  90C29 90C46 90C32
Full Text:

A method of centers with approximate subgradient linearizations for nonsmooth convex optimization. (English)Zbl 1207.90083

MSC:  90C25 65K05
Full Text:

Lagrangian relaxation via ballstep subgradient methods. (English)Zbl 1341.90100

MSC:  90C25 90C56 90B10
Full Text:

MSC:  90C25
Full Text:

Full Text:

Full Text:

A proximal-projection bundle method for Lagrangian relaxation, including semidefinite programming. (English)Zbl 1132.65055

MSC:  65K05 90C25 90C22
Full Text:

MSC:  90C25
Full Text:

Computing the Minkowski sum of prisms. (English)Zbl 1097.52500

MSC:  52A07 26A27 90C08
Full Text:

An efficient algorithm for the smallest enclosing ball problem in high dimensions. (English)Zbl 1090.65076

MSC:  65K05 90C25
Full Text:

Nonlinear optimization. (English)Zbl 1108.90001

Princeton, NJ: Princeton University Press (ISBN 0-691-11915-5/hbk). xii, 448 p. (2006).
MSC:  90-01 90C25 90C30

A proximal trust-region algorithm for column generation stabilization. (English)Zbl 1079.90097

MSC:  90C25 90C56 90B20
Full Text:

Vector variational inequalities for nondifferentiable convex vector optimization problems. (English)Zbl 1130.90394

MSC:  90C29 49J40
Full Text:

Minimal fractions of compact convex sets. (English)Zbl 1093.49012

Giannessi, Franco (ed.) et al., Variational analysis and applications. Proceedings of the 38th conference of the School of Mathematics “G. Stampacchia” in memory of G. Stampacchia and J.-L. Lions, Erice, Italy, June 20–July 1, 2003. New York, NY: Springer (ISBN 0-387-24209-0/hbk; 0-387-24276-7/e-book ). Nonconvex Optimization and its Applications 79, 791-811 (2005).
MSC:  49J52 26A27 90C30

On inclusion and summands of bounded closed convex sets. (English)Zbl 1084.52001

MSC:  52A07 90C30 26A27
Full Text:

An interior point cutting plane method for the convex feasibility problem with second-order cone inequalities. (English)Zbl 1082.90138

MSC:  90C51 90C25
Full Text:

Interior gradient and epsilon-subgradient descent methods for constrained convex minimization. (English)Zbl 1082.90087

MSC:  90C25 90C51
Full Text:

Convergence of approximate and incremental subgradient methods for convex optimization. (English)Zbl 1063.90039

MSC:  90C25 65K05
Full Text:

On embedding the volume algorithm in a variable target value method. (English)Zbl 1054.90054

MSC:  90C25 90C05 90C06
Full Text:

The log-quadratic proximal methodology in convex optimization algorithms and variational inequalities. (English)Zbl 1129.90337

Daniele, Patrizia (ed.) et al., Equilibrium problems and variational models. Based on the meeting, Erice, Italy, June 23–July 2, 2000. Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-7470-0/hbk). Nonconvex Optim. Appl. 68, 19-52 (2003).
MSC:  90C25 49J40

Full Text:

Monotone modifications of $$r$$-algorithms and their applications. (English. Russian original)Zbl 1044.90092

Cybern. Syst. Anal. 38, No. 6, 855-872 (2002); translation from Kibern. Sist. Anal. 2002, No. 6, 74-96 (2002).
MSC:  90C56 90C20 90C26
Full Text:

Full Text:

Generalized level method with approximated data. (English)Zbl 1109.90328

MSC:  90C25 65K05
Full Text:

Minimization of a nondifferentiable convex function defined not everywhere. (English)Zbl 1036.65050

MSC:  65K05 90C25 90C06
Full Text:

Full Text:

MSC:  90C25
Full Text:

Convergence rate of incremental subgradient algorithms. (English)Zbl 0984.90033

Uryasev, Stanislav (ed.) et al., Stochastic optimization: Algorithms and applications. Conference, Univ. of Florida, Tallahassee, FL, USA, February 20-22, 2000. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 54, 223-264 (2001).
MSC:  90C25 52A41 90C15

Numerical behavior of the method of projection onto an acute cone with level control in convex minimization. (English)Zbl 1014.65048

MSC:  65K05 90C25
Full Text:

Full Text:

Fixed and virtual stability center methods for convex nonsmooth minimization. (English)Zbl 0960.90068

Di Pillo, Gianni (ed.) et al., Nonlinear optimization and related topics. Workshop, Erice, Sicily, Italy, June 23-July 2, 1998. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 36, 105-122 (2000).
MSC:  90C25 90C56

Minimal pairs of compact convex sets, with application to quasidifferential calculus. (English)Zbl 0997.49014

Demyanov, V. (ed.) et al., Quasidifferentiability and related topics. Dedicated to Prof. Franco Giannessi on his 65th birthday and to Prof. Diethard Pallaschke on his 60th birthday. Dordrecht: Kluwer Academic Publishers. Nonconvex Optim. Appl. 43, 173-213 (2000).

Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. (English)Zbl 0958.65070

MSC:  65K05 90C25
Full Text:

On relations between vector variational inequality and vector optimization problem. (English)Zbl 0969.49003

Yang, Xiaoqi (ed.) et al., Progress in optimization. Contributions from Australasia. Papers of the 5th optimization days (OD) mini-conference, Univ. of Western Australia, Perth, Australia, June 29-30, 1998. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 39, 167-179 (2000).
MSC:  49J40 90C29 49J52

On some relations between generalized partial derivatives and convex functions. (English)Zbl 0989.49021

Nguyen, Van Hien (ed.) et al., Optimization. Proceedings of the 9th Belgian-French-German conference, Namur, Belgium, September 7-11, 1998. Berlin: Springer. Lect. Notes Econ. Math. Syst. 481, 381-395 (2000).
MSC:  49J52 90C25

Using analytic center and cutting planes methods for nonsmooth convex programming. (English)Zbl 1012.90036

Nguyen, Van Hien (ed.) et al., Optimization. Proceedings of the 9th Belgian-French-German conference, Namur, Belgium, September 7-11, 1998. Berlin: Springer. Lect. Notes Econ. Math. Syst. 481, 339-356 (2000).
MSC:  90C25 90C57

Efficiency of proximal bundle methods. (English)Zbl 0985.90072

MSC:  90C25 90C60 49J30
Full Text:

The efficiency of ballstep subgradient level methods for convex optimization. (English)Zbl 0977.90036

MSC:  90C25 90C60
Full Text:

Full Text:

A projection-proximal bundle method for convex nondifferentiable minimization. (English)Zbl 0944.65068

Théra, Michel (ed.) et al., Ill-posed variational problems and regularization techniques. Proceedings of a workshop, Univ. of Trier, Germany, September 3-5, 1998. Berlin: Springer. Lect. Notes Econ. Math. Syst. 477, 137-150 (1999).
MSC:  65K05 90C25 90C48

Proximal quasi-Newton methods for nondifferentiable convex optimization. (English)Zbl 0946.90111

MSC:  90C53 90C25
Full Text:

A bundle Bregman proximal method for convex nondifferentiable minimization. (English)Zbl 0955.90101

MSC:  90C25 65K05
Full Text:

Convergence of a simple subgradient level method. (English)Zbl 0956.90032

MSC:  90C25 90C56
Full Text:

Codifferentiable mappings with applications to vector optimality. (English)Zbl 0946.49012

Reviewer: N.I.Yanev (Sofia)

Penalty and augmented Lagrangian in general optimization problems. (English)Zbl 1028.90062

Butzer, P. L. (ed.) et al., Karl der Große und sein Nachwirken. 1200 Jahre Kultur und Wissenschaft in Europa. Band 2: Mathematisches Wissen. Turnhout: Brepols. 423-437 (1998).
MSC:  90C30 52A07 26A27

The cobweb method for minimizing convex functions. (English)Zbl 0942.65063

De Leone, Renato (ed.) et al., High performance algorithms and software in nonlinear optimization. Conference, HPSNO 97, Ischia, Italy, June 1997. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 24, 101-108 (1998).
MSC:  65K05 90C25 65Y05

An interior-point based subgradient method for nondifferentiable convex optimization. (English)Zbl 0946.90058

MSC:  90C25 90C52 49J50
Full Text:

Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized $$(F,\rho)$$-convexity. (English)Zbl 0927.90100

MSC:  90C32 49J52 26B25
Full Text:

MSC:  90C25

Full Text:

Relaxation methods for strictly convex regularizations of piecewise linear programs. (English)Zbl 0918.65043

Reviewer: J.Guddat (Berlin)
Full Text:

Subgradient algorithm on Riemannian manifolds. (English)Zbl 0907.90244

MSC:  90C30 90C48 49J52
Full Text:

Optimal power generation under uncertainty via stochastic programming. (English)Zbl 0907.90197

Marti, Kurt (ed.) et al., Stochastic programming methods and technical applications. Proceedings of the 3rd GAMM/ IFIP-Workshop on “Stochastic optimization: numerical methods and applications”, Federal Armed Forces University Munich, Neubiberg/ Munich, Germany, June 17–20, 1996. Berlin: Springer. Lect. Notes Econ. Math. Syst. 458, 22-56 (1998).

A method for minimizing convex functions based on continuous approximations to the subdifferential. (English)Zbl 0904.90128

MSC:  90C25 49J52
Full Text:

Full Text:

Subgradient method with entropic projections for convex nondifferentiable minimization. (English)Zbl 0897.90176

MSC:  90C30 49J52
Full Text:

MSC:  90C25
Full Text:

Analysis of regularization techniques in convex nondifferentiable optimization. (English)Zbl 0915.90217

Zimmermann, Uwe (ed.) et al., Operations research proceedings 1996. Selected papers of the symposium, SOR’96, Braunschweig, Germany, September 3-6, 1996. Berlin: Springer. 20-25 (1997).
MSC:  90C25 49J52

Full Text:

Proximal minimization methods with generalized Bregman functions. (English)Zbl 0890.65061

MSC:  65K05 90C25
Full Text:

On convex class of pairs of convex bodies. (English)Zbl 0885.52004

MSC:  52A07 90C30 26A27
Full Text:

all top 5

all top 5

all top 5

all top 3

all top 3