Výsledky vyhľadávania - 90C25 Mathematical Programming - convex programming

Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization.

Autori: Altschuler, Jason M. Parrilo, Pablo A.

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1105-1118. 14p.

Predmety: *MATHEMATICAL optimization, CONVEX programming, OPTIMIZATION algorithms, CONVEX functions

A projection-free method for solving convex bilevel optimization problems.

Autori: Giang-Tran, Khanh-Hung Ho-Nguyen, Nam Lee, Dabeen

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p907-940. 34p.

Predmety: *LINEAR programming, BILEVEL programming, CONVEX programming, NUMERICAL analysis, CONVEX functions, OPTIMIZATION algorithms

Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time.

Autori: Bartan, Burak Pilanci, Mert

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p737-769. 33p.

Predmety: *ARTIFICIAL neural networks, SEMIDEFINITE programming, GLOBAL optimization, COST functions, COMPUTATIONAL complexity, CONVEX programming, BACK propagation

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient.

Autori: Latafat, Puya Themelis, Andreas Stella, Lorenzo a ďalší

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p433-471. 39p.

Predmety: CONVEX programming, LIPSCHITZ continuity, SMOOTHNESS of functions, COMPUTER simulation, SUBGRADIENT methods

Accelerated stochastic approximation with state-dependent noise.

Autori: Ilandarideva, Sasila Juditsky, Anatoli Lan, Guanghui a ďalší

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p239-280. 42p.

Predmety: *ESTIMATION theory, CONVEX programming, OPTIMIZATION algorithms, STOCHASTIC programming

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

Autori: Auslender, A. Teboulle, M.

Zdroj: Mathematics of Operations Research, 2004 Feb 01. 29(1), 1-26.

Prístupová URL adresa: https://www.jstor.org/stable/30035629

Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

Autori: Alvarez, Felipe Carrasco, Miguel Pichard, Karine

Zdroj: Mathematics of Operations Research, 2005 Nov 01. 30(4), 966-984.

Prístupová URL adresa: https://www.jstor.org/stable/25151697

Homogeneous second-order descent framework: a fast alternative to Newton-type methods.

Autori: He, Chang Jiang, Yuntian Zhang, Chuwen a ďalší

Zdroj: Mathematical Programming. May2025, p1-62.

Predmety: *MATHEMATICAL optimization, NONCONVEX programming, OPTIMIZATION algorithms, CONVEX programming

A simple uniformly optimal method without line search for convex optimization.

Autori: Li, Tianjiao Lan, Guanghui

Zdroj: Mathematical Programming. Jul2025, p1-38.

Predmety: *MATHEMATICAL optimization, CONVEX programming, OPTIMIZATION algorithms, NUMERICAL calculations, HOLDER spaces

A class of ADMM-based algorithms for three-block separable convex programming.

Autori: He, Bingsheng Yuan, Xiaoming

Zdroj: Computational Optimization & Applications. Jul2018, Vol. 70 Issue 3, p791-826. 36p.

Predmety: *MATHEMATICAL programming, *STOCHASTIC convergence, *MATHEMATICAL optimization, *MATHEMATICAL models, CONVEX programming

Nonlinear distributionally robust optimization.

Autori: Sheriff, Mohammed Rayyan Mohajerin Esfahani, Peyman

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p639-698. 60p.

Predmety: *MATHEMATICAL optimization, *NONLINEAR programming, *RISK assessment, ROBUST optimization, DERIVATIVES (Mathematics), SMOOTHNESS of functions, NONSMOOTH optimization, MODEL validation

Shapes and recession cones in mixed-integer convex representability.

Autori: Zadik, Ilias Lubin, Miles Vielma, Juan Pablo

Zdroj: Mathematical Programming. Mar2024, Vol. 204 Issue 1/2, p739-752. 14p.

Predmety: *RECESSIONS, *INTEGER programming, CONVEX programming, CONVEX sets, COMBINATORIAL optimization, POLYTOPES

Geografický termín: WATERLOO (Ont.)

Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets.

Autori: Kostyukova, Olga Tchemisova, Tatiana

Zdroj: Journal of Optimization Theory & Applications. Oct2017, Vol. 175 Issue 1, p76-103. 28p.

Predmety: *MATHEMATICAL programming, *FUNCTIONAL equations, *MATHEMATICAL optimization, *MATHEMATICS, *CONVEX functions, *REAL variables

Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup.

Autori: Cheung, Yun Kuen Cole, Richard Tao, Yixin

Zdroj: Mathematical Programming. Nov2021, Vol. 190 Issue 1/2, p615-677. 63p.

Predmety: *STOCHASTIC analysis, *MATHEMATICAL programming, *ALGORITHMS, CONVEX functions, CONVEX programming

Path following in the exact penalty method of convex programming.

Autori: Zhou, Hua Lange, Kenneth

Zdroj: Computational Optimization & Applications. Jul2015, Vol. 61 Issue 3, p609-634. 26p.

Predmety: *MATHEMATICAL programming, *NONLINEAR programming, *ESTIMATION theory, CONVEX programming, CONSTRAINT satisfaction

Condition numbers and error bounds in convex programming.

Autori: Coulibaly, A. Crouzeix, J.-P.

Zdroj: Mathematical Programming. Jan2009, Vol. 116 Issue 1/2, p79-113. 35p.

Predmety: *CONVEX programming, *MATHEMATICAL programming, *CONVEX sets, *CONVEX functions, *REAL variables, *LINEAR systems

A parametric approach for solving convex quadratic optimization with indicators over trees.

Autori: Bhathena, Aaresh Fattahi, Salar Gómez, Andrés a ďalší

Zdroj: Mathematical Programming. May2025, p1-46.

Predmety: *DYNAMIC programming, *REAL-time computing, QUADRATIC programming, TREE graphs, DUMMY variables, CONVEX programming, HIDDEN Markov models

A condition number theorem in convex programming.

Autori: Zolezzi, Tullio¹ zolezzi@dima.unige.it

Zdroj: Mathematical Programming. Feb2015, Vol. 149 Issue 1/2, p195-207. 13p.

Predmety: *CONVEX programming, *NUMBER theory, *MATHEMATICAL inequalities, *PERTURBATION theory, *LIPSCHITZ spaces

Duality Theorems for Separable Convex Programming Without Qualifications.

Autori: Suzuki, Satoshi Kuroiwa, Daishi

Zdroj: Journal of Optimization Theory & Applications. Feb2017, Vol. 172 Issue 2, p669-683. 15p.

Predmety: *DUALITY theory (Mathematics), *CONVEX programming, *LAGRANGE equations, *MATHEMATICAL optimization, *LINEAR programming

Dual–primal proximal point algorithms for extended convex programming.

Autori: Li, Min Jiang, Zhikai Zhou, Zhangjin

Zdroj: International Journal of Computer Mathematics. Jul2015, Vol. 92 Issue 7, p1473-1495. 23p.

Predmety: *Algorithms, Linear programming, Mathematical regularization, Computational complexity, Mathematical proofs