Naval personnel Assignment: an Application of linear-quadratic penalty Methods. - Mustafa Ç. Pinar; Stavros A. Zenios (Computer Science and Operations Research, 1992)

Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm. - Mustafa Ç. Pinar; Stavros A. Zenios (INFORMS J. Comput., 1992)

Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization. - Stavros A. Zenios; Mustafa Ç. Pinar (SIAM J. Sci. Comput., 1992)

A Comparative Study of Parallel Decompositions for Multicommodity Flow Problems. - Mustafa Ç. Pinar; Stavros A. Zenios (Parallel Algorithms Appl., 1993)

New characterizations of ℓ1 solutions to overdetermined systems of linear equations. - Kaj Madsen; Hans Bruun Nielsen; Mustafa Ç. Pinar (Oper. Res. Lett., 1994)

On Smoothing Exact Penalty Functions for Convex Constrained Optimization. - Mustafa Ç. Pinar; Stavros A. Zenios (SIAM J. Optim., 1994)

A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows. - Mustafa Ç. Pinar; Stavros A. Zenios (ACM Trans. Math. Softw., 1994)

Decomposing Linear Programs for Parallel Solution. - Ali Pinar; Ümit V. Çatalyürek; Cevdet Aykanat; Mustafa Ç. Pinar (PARA, 1995)

Implementation of QR Up- and Downdating on a Massively Parallel Computer. - Claus Bendtsen; Per Christian Hansen; Kaj Madsen; Hans Bruun Nielsen; Mustafa Ç. Pinar (Parallel Comput., 1995)

The Parallel Surrogate Constraint Approach to the Linear Feasibility Problem. - Hakan Özaktas; Mustafa Akgül; Mustafa Ç. Pinar (PARA, 1996)

Linear programming via a quadratic penalty function. - Mustafa Ç. Pinar (Math. Methods Oper. Res., 1996)

A New Finite Continuation Algorithm for Linear Programming. - Kaj Madsen; Hans Bruun Nielsen; Mustafa Ç. Pinar (SIAM J. Optim., 1996)

Newton's method for linear inequality systems. - Mustafa Ç. Pinar (Eur. J. Oper. Res., 1998)

A Finite Continuation Algorithm for Bound Constrained Quadratic Programming. - Kaj Madsen; Hans Bruun Nielsen; Mustafa Ç. Pinar (SIAM J. Optim., 1998)

Continuation method for nonlinear complementarity problems via normal maps. - Bintong Chen; Patrick T. Harker; Mustafa Ç. Pinar (Eur. J. Oper. Res., 1999)

Bound constrained quadratic programming via piecewise quadratic functions. - Kaj Madsen; Hans Bruun Nielsen; Mustafa Ç. Pinar (Math. Program., 1999)

A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications. - Mustafa Ç. Pinar (Eur. J. Oper. Res., 2000)

On closed-form solutions of a resource allocation problem in parallel funding of R&D projects. - Ülkü Gürler; Mustafa Ç. Pinar; Mohamed Mehdi Jelassi (Oper. Res. Lett., 2000)

The robust spanning tree problem with interval data. - Hande Yaman; Oya Ekin Karasan; Mustafa Ç. Pinar (Oper. Res. Lett., 2001)

A global error bound for quadratic perturbation of linear programs. - Mustafa Ç. Pinar (Appl. Math. Lett., 2002)

A Derivation of Lovász' Theta via Augmented Lagrange Duality. - Mustafa Ç. Pinar (RAIRO Oper. Res., 2003)

Constrained Nonlinear Programming for Volatility Estimation with GARCH Models. - Aslihan Altay-Salih; Mustafa Ç. Pinar; Sven Leyffer (SIAM Rev., 2003)

A note on robust 0-1 optimization with uncertain cost coefficients. - Mustafa Ç. Pinar (4OR, 2004)

Finite Computation of the l1 Estimator from Huber's M-Estimator in Linear Regression. - Mustafa Ç. Pinar (Computing, 2004)

Virtual Private Network Design Under Traffic Uncertainty. - Aysegül Altin; Edoardo Amaldi; Pietro Belotti; Mustafa Ç. Pinar (Electron. Notes Discret. Math., 2004)

Robust profit opportunities in risky financial portfolios. - Mustafa Ç. Pinar; Reha H. Tütüncü (Oper. Res. Lett., 2005)

An exact algorithm for the capacitated vertex p-center problem. - F. Aykut Özsoy; Mustafa Ç. Pinar (Comput. Oper. Res., 2006)

Feature Cluster "Advances in Continuous Optimization". - Bülent Karasözen; Mustafa Ç. Pinar; Tamás Terlaky; Gerhard-Wilhelm Weber (Eur. J. Oper. Res., 2006)

Huber approximation for the non-linear l. - Mustafa Ç. Pinar; Wolfgang M. Hartmann (Eur. J. Oper. Res., 2006)

On the S-procedure and Some Variants. - Kürsad Derinkuyu; Mustafa Ç. Pinar (Math. Methods Oper. Res., 2006)

On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball. - Mustafa Ç. Pinar; Marc Teboulle (RAIRO Oper. Res., 2006)

Parallel image restoration using surrogate constraint methods. - Bora Uçar; Cevdet Aykanat; Mustafa Ç. Pinar; Tahir Malas (J. Parallel Distributed Comput., 2007)

Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. - Hande Yaman; Oya Ekin Karasan; Mustafa Ç. Pinar (Math. Program., 2007)

Provisioning virtual private networks under traffic uncertainty. - Aysegül Altin; Edoardo Amaldi; Pietro Belotti; Mustafa Ç. Pinar (Networks, 2007)

An improved probability bound for the Approximate S-Lemma. - Kürsad Derinkuyu; Mustafa Ç. Pinar; Ahmet Camci (Oper. Res. Lett., 2007)

Robust scenario optimization based on downside-risk measure for multi-period portfolio selection. - Mustafa Ç. Pinar (OR Spectr., 2007)

Sharpe-ratio pricing and hedging of contingent claims in incomplete markets by convex programming. - Mustafa Ç. Pinar (Autom., 2008)

Structured least squares with bounded data uncertainties. - Mert Pilanci; Orhan Arikan; Barlas Oguz; Mustafa Ç. Pinar (ICASSP, 2009)

Pricing American Perpetual Warrants by Linear Programming. - Robert J. Vanderbei; Mustafa Ç. Pinar (SIAM Rev., 2009)

Overdetermined Systems of Linear Equations. - Mustafa Ç. Pinar (Encyclopedia of Optimization, 2009)

A model and case study for efficient shelf usage and assortment analysis. - Mehmet Murat Fadiloglu; Oya Ekin Karasan; Mustafa Ç. Pinar (Ann. Oper. Res., 2010)

Expected gain-loss pricing and hedging of contingent claims in incomplete markets by linear programming. - Mustafa Ç. Pinar; Aslihan Altay-Salih; Ahmet Camci (Eur. J. Oper. Res., 2010)

Structured least squares problems and robust estimators. - Mert Pilanci; Orhan Arikan; Mustafa Ç. Pinar (IEEE Trans. Signal Process., 2010)

Gain-loss based convex risk limits in discrete-time trading. - Mustafa Ç. Pinar (Comput. Manag. Sci., 2011)

The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. - Aysegül Altin; Hande Yaman; Mustafa Ç. Pinar (INFORMS J. Comput., 2011)

Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets. - Mustafa Ç. Pinar (Optim. Lett., 2013)

The Best Gain-Loss Ratio is a Poor Performance Measure. - Sara Biagini; Mustafa Ç. Pinar (SIAM J. Financial Math., 2013)

Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming. - Mustafa Ç. Pinar (Discret. Appl. Math., 2014)

Equilibrium in an ambiguity-averse mean-variance investors market. - Mustafa Ç. Pinar (Eur. J. Oper. Res., 2014)

Sur l'allocation dynamique de portefeuille robuste contre l'incertitude des rendements moyens. - Mustafa Ç. Pinar (INFOR Inf. Syst. Oper. Res., 2014)

Mean semi-deviation from a target and robust portfolio choice under distribution and mean return ambiguity. - Mustafa Ç. Pinar; A. Burak Paç (J. Comput. Appl. Math., 2014)

Delegated portfolio management under ambiguity aversion. - Annalisa Fabretti; Stefano Herzel; Mustafa Ç. Pinar (Oper. Res. Lett., 2014)

Non-linear pricing by convex duality. - Mustafa Ç. Pinar (Autom., 2015)

Joint mixability of some integer matrices. - Fabio Bellini; Oya Ekin Karasan; Mustafa Ç. Pinar (Discret. Optim., 2016)

Special issue on "Non-linear continuous optimization". - Regina Sandra Burachik; C. Yalçin Kaya; Mustafa Ç. Pinar (EURO J. Comput. Optim., 2016)

Robust screening under ambiguity. - Mustafa Ç. Pinar; Can Kizilkale (Math. Program., 2017)

Optimal allocation with costly inspection and discrete types under ambiguity. - Halil I. Bayrak; Kemal Güler; Mustafa Ç. Pinar (Optim. Methods Softw., 2017)

Robust auction design under multiple priors by linear and integer programming. - Çagil Koçyigit; Halil I. Bayrak; Mustafa Ç. Pinar (Ann. Oper. Res., 2018)

On robust portfolio and naïve diversification: mixing ambiguous and unambiguous assets. - A. Burak Paç; Mustafa Ç. Pinar (Ann. Oper. Res., 2018)

Robust bilateral trade with discrete types. - Kamyar Kargar; Halil Ibrahim Bayrak; Mustafa Ç. Pinar (EURO J. Comput. Optim., 2018)

Robust trading mechanisms over 0/1 polytopes. - Mustafa Ç. Pinar (J. Comb. Optim., 2018)

On explicit solutions of a two-echelon supply chain coordination game. - Mustafa Ç. Pinar (Optim. Lett., 2018)

Deblurring Text Images Using Kernel Dictionaries. - Tolga Dizdarer; Mustafa Ç. Pinar (IPTA, 2019)

On envy-free perfect matching. - Claudio Arbib; Oya Ekin Karasan; Mustafa Ç. Pinar (Discret. Appl. Math., 2019)

Bilateral trade with risk-averse intermediary using linear network optimization. - Halil I. Bayrak; Kamyar Kargar; Mustafa Ç. Pinar (Networks, 2019)

Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines. - Mustafa Ç. Pinar (SIAM J. Matrix Anal. Appl., 2019)

Codon optimization: a mathematical programing approach. - Alper Sen 002; Kamyar Kargar; Esma Akgün; Mustafa Ç. Pinar (Bioinform., 2020)

Codon optimization by 0-1 linear programming. - Claudio Arbib; Mustafa Ç. Pinar; Fabrizio Rossi; Alessandra Tessitore (Comput. Oper. Res., 2020)

Competitive location and pricing on a line with metric transportation costs. - Claudio Arbib; Mustafa Ç. Pinar; Matteo Tonelli (Eur. J. Oper. Res., 2020)

Minimizers of Sparsity Regularized Huber Loss Function. - Deniz Akkaya; Mustafa Ç. Pinar (J. Optim. Theory Appl., 2020)

The Quantile Matching Problem and Point Cloud Registration. - Stéphane Chrétien; Oya Ekin Karasan; Ecenur Oguz; Mustafa Ç. Pinar (ACDA, 2021)

Assortment and Cut of Defective Stocks by Bilevel Programming. - Claudio Arbib; Fabrizio Marinelli 001; Mustafa Ç. Pinar; Andrea Pizzuti (ICORES, 2022)

Subset based error recovery. - Ömer Ekmekcioglu; Deniz Akkaya; Mustafa Ç. Pinar (Signal Process., 2022)

PCA Sparsified. - Fatih S. Aktas; Mustafa Ç. Pinar (SIAM J. Optim., 2023)

Graph neural networks for deep portfolio optimization. - Ömer Ekmekcioglu; Mustafa Ç. Pinar (Neural Comput. Appl., 2023)

Separable Bregman Framework for Sparsity Constrained Nonlinear Optimization. - Fatih S. Aktas; Mustafa Ç. Pinar (CoRR, 2024)

MAD risk parity portfolios. - Çagin Ararat; Francesco Cesarone; Mustafa Çelebi Pinar; Jacopo M. Ricci (Ann. Oper. Res., 2024)

Point cloud registration with quantile assignment. - Ecenur Oguz; Yalim Dogan; Ugur Güdükbay; Oya Ekin Karasan; Mustafa Ç. Pinar (Mach. Vis. Appl., 2024)

Sparsity penalized mean-variance portfolio selection: analysis and computation. - Buse Sen; Deniz Akkaya; Mustafa Ç. Pinar (Math. Program., 2025)