default search action
Journal of Optimization Theory and Applications, Volume 192
Volume 192, Number 1, January 2022
- Mohamad Abdolmaleki, Ali Mashhadian, Sorosh Amiri, Vahid Esfahanian, Hossein Afshin:
Numerical-Experimental Geometric Optimization of the Ahmed Body and Analyzing Boundary Layer Profiles. 1-35 - Elimhan N. Mahmudov:
Optimization of Higher-Order Differential Inclusions with Special Boundary Value Conditions. 36-55 - Luis M. Briceño-Arias, Julio Deride, Cristian Vega:
Random Activations in Primal-Dual Splittings for Monotone Inclusions with a Priori Information. 56-81 - Duong Thi Viet An, Abderrahim Jourani:
Subdifferentials of the Marginal Functions in Parametric Convex Optimization via Intersection Formulas. 82-96 - Spyridon Pougkakiotis, Jacek Gondzio:
An Interior Point-Proximal Method of Multipliers for Linear Positive Semi-Definite Programming. 97-129 - Li-Hsien Sun:
Mean Field Games with Heterogeneous Groups: Application to Banking Systems. 130-167 - Christian Grussler, Pontus Giselsson:
Efficient Proximal Mapping Computation for Low-Rank Inducing Norms. 168-194 - Pham Huu Sach, Le Anh Tuan:
Existence of Solutions of Bifunction-Set Optimization Problems in Metric Spaces. 195-225 - Bui Van Dinh, Tien-Son Pham:
Error Bounds of Regularized Gap Functions for Polynomial Variational Inequalities. 226-247 - Naoki Hamada, Shunsuke Ichiki:
Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency. 248-270 - Carlos Camilo-Garay, Rolando Cavazos-Cadena, Hugo Cruz-Suárez:
Contractive Approximations in Risk-Sensitive Average Semi-Markov Decision Chains on a Finite State Space. 271-291 - Nikitas Rontsis, Paul Goulart, Yuji Nakatsukasa:
Efficient Semidefinite Programming with Approximate ADMM. 292-320 - Lu-Bin Cui, Yu-Dong Fan, Yisheng Song, Shi-Liang Wu:
The Existence and Uniqueness of Solution for Tensor Complementarity Problem and Related Systems. 321-334 - Jie Wang, Victor Magron:
Exploiting Sparsity in Complex Polynomial Optimization. 335-359 - Amar Andjouh, Mohand Ouamer Bibi:
Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems. 360-378 - Wei Ni, Xiaoli Wang:
A Multi-Scale Method for Distributed Convex Optimization with Constraints. 379-400
Volume 192, Number 2, February 2022
- Abdeslem Hafid Bentbib, Anas El Hachimi, Khalide Jbilou, Ahmed Ratnani:
A Tensor Regularized Nuclear Norm Method for Image and Video Completion. 401-425 - Duong Thi Viet An:
Second-Order Optimality Conditions for Infinite-Dimensional Quadratic Programs. 426-442 - Tong-tong Shang, Jing Yang, Guo-ji Tang:
Generalized Polynomial Complementarity Problems over a Polyhedral Cone. 443-483 - Vy Khoi Le:
On Inclusions with Monotone-Type Mappings in Nonreflexive Banach Spaces. 484-509 - Jiaxi Wang, Wei Ouyang:
Newton's Method for Solving Generalized Equations Without Lipschitz Condition. 510-532 - Yiyin Cao, Chuangyin Dang, Yabin Sun:
Complementarity Enhanced Nash's Mappings and Differentiable Homotopy Methods to Select Perfect Equilibria. 533-563 - Jin Zhang, Xide Zhu:
Linear Convergence of Prox-SVRG Method for Separable Non-smooth Convex Optimization Problems under Bounded Metric Subregularity. 564-597 - Sujit Kumar De, Kousik Bhattacharya:
A Pollution Sensitive Marxian Production Inventory Model with Deterioration Under Fuzzy System. 598-627 - Kuntal Som, Vellaichamy Vetrivel:
A Note on Pointwise Well-Posedness of Set-Valued Optimization Problems. 628-647 - Yuning Yang, Chang Liang:
Computing the Largest C-Eigenvalue of a Tensor Using Convex Relaxation. 648-677 - Feng Zhang:
Sufficient Maximum Principle for Stochastic Optimal Control Problems with General Delays. 678-701 - Youyicun Lin, Sheng-Long Hu:
B-Subdifferential of the Projection onto the Generalized Spectraplex. 702-724 - Ayal Taitler, Ilya Ioslovich, Erez Karpas, Per-Olof Gutman:
Minimum Mixed Time-Energy Trajectory Planning of a Nonlinear Vehicle Subject to 2D Disturbances. 725-757
Volume 192, Number 3, March 2022
- Steven Duda, Edeltraud Gehrig, Thomas Lorenz:
External Ellipsoidal Approximations for Set Evolution Equations. 759-798 - Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta:
Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds. 799-829 - Bo Zhang, Yuelin Gao, Xia Liu, XiaoLi Huang:
An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems. 830-855 - Loïc Bourdin, Fabien Caubet, Aymeric Jacob de Cordemoy:
Sensitivity Analysis of a Scalar Mechanical Contact Problem with Perturbation of the Tresca's Friction Law. 856-890 - Felipe Lara:
On Strongly Quasiconvex Functions: Existence Results and Proximal Point Algorithms. 891-911 - Shouqiang Du, Liyuan Cui, Yuanyuan Chen, Yimin Wei:
Stochastic Tensor Complementarity Problem with Discrete Distribution. 912-929 - Cody Allen, Maurício C. de Oliveira:
A Minimal Cardinality Solution to Fitting Sawtooth Piecewise-Linear Functions. 930-959 - Gottfried Sachs, Benedikt Grüter:
Optimization of Thrust-Augmented Dynamic Soaring. 960-978 - Fengsheng Wu, Chaoqian Li, Yaotang Li:
Manifold Regularization Nonnegative Triple Decomposition of Tensor Sets for Image Compression and Representation. 979-1000 - Kathleen A. Hoffman, Thomas I. Seidman:
Approximation of an Elastic Rod with Self-Contact. 1001-1021 - Fernando M. Lobo Pereira, Nathalie T. Khalil:
A Maximum Principle for a Time-Optimal Bilevel Sweeping Control Problem. 1022-1051 - Fernando García Castaño, Miguel A. Melguizo Padial:
Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Processes. 1052-1066 - Ademir A. Ribeiro, Mael Sachine, Evelin H. M. Krulikovski:
A Comparative Study of Sequential Optimality Conditions for Mathematical Programs with Cardinality Constraints. 1067-1083 - Jean-Baptiste Bouvier, Melkior Ornik:
The Maximax Minimax Quotient Theorem. 1084-1101
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.